{"meta":{"query_hash":"3cfac4259dfa","filters":{"venue":"IEEE Journal on Selected Areas in Communications"},"cohort_total":384,"direct_labels_cover":0,"predictions_cover":384,"exported":384,"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/3cfac4259dfa","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Journal+on+Selected+Areas+in+Communications"},"results":[{"id":"W1497754119","doi":"10.1109/jsac.2015.2435451","title":"Stochastic Geometric Analysis of User Mobility in Heterogeneous Wireless Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":133,"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":"Computer science; Handover; Wireless network; Computer network; Stochastic geometry; Correctness; Network topology; Overhead (engineering); Wireless; Heterogeneous network; Randomness; Mobility model; Distributed computing; Algorithm; Telecommunications","score_opus":0.06691783397807413,"score_gpt":0.3370538354872839,"score_spread":0.2701360015092098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497754119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117876545,0.0008729896,0.8748971,0.0007275295,0.000071946466,0.00008059275,0.0001993197,0.00025854443,0.0050153504],"genre_scores_gemma":[0.97902894,0.0008969763,0.017658519,0.00009685108,0.0000993956,0.00009318378,0.00020129175,0.000050498988,0.001874288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998926,0.00038329806,0.000040744897,0.0001482837,0.00032636744,0.0001752596],"domain_scores_gemma":[0.99687696,0.0017057747,0.00059153105,0.00024234423,0.00044190243,0.00014139939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016072172,0.0011268739,0.00078407844,0.0017797431,0.00062456646,0.0011436348,0.0014240153,0.0008470442,0.00090838625],"category_scores_gemma":[0.006092227,0.00053125696,0.00080201897,0.0011461077,0.0018219546,0.0020035412,0.0015179089,0.00083353533,0.00020193853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015466407,0.000011260842,0.0012072833,0.000016469636,0.00002018368,0.00011507428,0.000052450727,0.92235637,0.000893948,0.07145479,0.00046849737,0.0033882763],"study_design_scores_gemma":[0.0000015110002,0.000008793994,0.0003681387,0.0000021471549,0.0000036555416,0.000025679423,0.000016334263,0.9878897,0.000086716005,0.011370073,0.00022008021,0.0000072029025],"about_ca_topic_score_codex":0.00580486,"about_ca_topic_score_gemma":0.0026213424,"teacher_disagreement_score":0.00580486,"about_ca_system_score_codex":0.0022328002,"about_ca_system_score_gemma":0.0006829043,"threshold_uncertainty_score":0.016200185},"labels":[],"label_agreement":null},{"id":"W1505562276","doi":"10.1109/jsac.2015.2432513","title":"Physical-Layer Security for MISO Visible Light Communication Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":259,"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; McMaster University","keywords":"Computer science; Transmitter; Visible light communication; Beamforming; Physical layer; Channel (broadcasting); Secure transmission; Secrecy; Computer network; Transmission (telecommunications); Telecommunications; Topology (electrical circuits); Wireless; Computer security; Electrical engineering; Physics; Light-emitting diode; Optics; Engineering","score_opus":0.05083687756006165,"score_gpt":0.32233816584297315,"score_spread":0.2715012882829115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505562276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05047627,0.0012802036,0.93996197,0.0005830378,0.00006361531,0.000040272404,0.000104705825,0.00011009963,0.0073799416],"genre_scores_gemma":[0.9626767,0.001597702,0.03389015,0.00012218619,0.00008371515,0.00005261296,0.000045262783,0.0000231209,0.0015084723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807715,0.0006851967,0.00007820097,0.00021007047,0.00061955134,0.00032981695],"domain_scores_gemma":[0.99603736,0.002450513,0.0006047107,0.00047892198,0.0003561389,0.00007239272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923366,0.001130814,0.0007425326,0.0005797197,0.0007042509,0.0019780349,0.0005996733,0.00087900006,0.0013789613],"category_scores_gemma":[0.005098904,0.0003474475,0.00047314318,0.00068251166,0.0019387557,0.0027681566,0.001968273,0.0010842821,0.00037865376],"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.00027682178,0.0000666305,0.0014932575,0.00034537478,0.000075466036,0.00043236167,0.00028085787,0.635022,0.03346738,0.29269245,0.0014971211,0.03435026],"study_design_scores_gemma":[0.000009419979,0.000077991615,0.00023510722,0.00003865109,0.000017550266,0.00015130074,0.0000642281,0.94722795,0.008292409,0.042582843,0.00127656,0.000026031108],"about_ca_topic_score_codex":0.0008197305,"about_ca_topic_score_gemma":0.00075679226,"teacher_disagreement_score":0.0019780349,"about_ca_system_score_codex":0.0012365408,"about_ca_system_score_gemma":0.0010282035,"threshold_uncertainty_score":0.010007799},"labels":[],"label_agreement":null},{"id":"W1529380551","doi":"10.1109/jsac.2015.2435358","title":"Analysis of <inline-formula> <tex-math notation=\"LaTeX\">$K$</tex-math></inline-formula>-Tier Uplink Cellular Networks With Ambient RF Energy Harvesting","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":105,"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":"Stochastic geometry; Computer science; Telecommunications link; Energy harvesting; Cellular network; Queueing theory; Power control; Markov chain; Poisson point process; Energy (signal processing); Poisson distribution; Computer network; Mathematics; Power (physics); Statistics","score_opus":0.020896397374887653,"score_gpt":0.24970872858679832,"score_spread":0.22881233121191066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529380551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04386417,0.00375378,0.91666716,0.0013222306,0.00014584386,0.00014180485,0.0010890211,0.00038062248,0.032635402],"genre_scores_gemma":[0.92469865,0.0064394213,0.0489982,0.0005067507,0.0002738882,0.0005006931,0.00095654465,0.0005038718,0.01712199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992938,0.00020506167,0.000023521796,0.00009437646,0.00019553915,0.0001878424],"domain_scores_gemma":[0.99617094,0.0023105415,0.0005347877,0.0001753584,0.0006928453,0.00011556355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626618,0.0015500749,0.0010546016,0.0010950378,0.0006132588,0.0018576804,0.0011978511,0.0010035015,0.009408287],"category_scores_gemma":[0.0056445147,0.00052372226,0.0010614394,0.0012962872,0.0012710206,0.0014323164,0.0016666887,0.0013452735,0.0012821167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029786892,0.000024960707,0.00076612155,0.00020050937,0.000039906616,0.00017443432,0.000110747635,0.9146486,0.0032222103,0.06768516,0.003708805,0.0093888715],"study_design_scores_gemma":[0.000002206959,0.00001532471,0.0002988494,0.000030697818,0.00001415151,0.000055980985,0.00003691327,0.9859061,0.0005377051,0.012053841,0.0010380843,0.000010094607],"about_ca_topic_score_codex":0.008862706,"about_ca_topic_score_gemma":0.006474332,"teacher_disagreement_score":0.009408287,"about_ca_system_score_codex":0.0026460034,"about_ca_system_score_gemma":0.0015399673,"threshold_uncertainty_score":0.031473875},"labels":[],"label_agreement":null},{"id":"W1566257247","doi":"10.1109/jsac.2015.2435391","title":"HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks","year":2015,"lang":"en","type":"preprint","venue":"IEEE Journal on Selected Areas in 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":"Carleton University","funders":"","keywords":"Heterogeneous network; Computer science; Poisson distribution; Base station; Wireless network; Spatial correlation; Cellular network; Moment (physics); Spatial heterogeneity; User equipment; Wireless; Computer network; Statistics; Telecommunications; Mathematics","score_opus":0.0258876139237047,"score_gpt":0.2655454055180485,"score_spread":0.2396577915943438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566257247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062067527,0.0005154188,0.93257666,0.00017594387,0.00007377708,0.00003970725,0.00024713136,0.00023707129,0.004066703],"genre_scores_gemma":[0.9517074,0.0010021455,0.042535804,0.000097796736,0.000089636495,0.00007888267,0.00031696327,0.000055735494,0.0041156197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958485,0.00014522263,0.0000124490925,0.00009044975,0.00010451847,0.00006263682],"domain_scores_gemma":[0.99961686,0.00018694755,0.00006658838,0.0000460292,0.000066326116,0.000017193592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137035,0.00062928855,0.00043840232,0.00047494326,0.0003679433,0.00090966735,0.0007862096,0.0004875396,0.0006323179],"category_scores_gemma":[0.0011035532,0.00021565931,0.0003560713,0.0010910673,0.00053922314,0.0009991142,0.00060964155,0.00043892526,0.000178544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056665693,0.00003184091,0.0024633654,0.00005570371,0.00003390437,0.000384327,0.00006979172,0.86926246,0.0050734747,0.091392845,0.0016961378,0.029479455],"study_design_scores_gemma":[0.0000021771496,0.000012453749,0.00041629592,0.0000031853806,0.0000051405386,0.00005840505,0.000019409074,0.98855305,0.00057414436,0.009303331,0.0010463573,0.0000059601157],"about_ca_topic_score_codex":0.0043818583,"about_ca_topic_score_gemma":0.0033868966,"teacher_disagreement_score":0.0043818583,"about_ca_system_score_codex":0.0007686371,"about_ca_system_score_gemma":0.00042418003,"threshold_uncertainty_score":0.008712709},"labels":[],"label_agreement":null},{"id":"W1588488887","doi":"10.1109/jsac.2015.2435291","title":"Revisiting Scheduling in Heterogeneous Networks When the Backhaul Is Limited","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Waterloo","funders":"","keywords":"Backhaul (telecommunications); Computer science; Bottleneck; Scheduling (production processes); Distributed computing; Computer network; Base station; Fair-share scheduling; Dynamic priority scheduling; Mathematical optimization; Quality of service; Mathematics","score_opus":0.04321998608898445,"score_gpt":0.280571984972502,"score_spread":0.23735199888351757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588488887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17035142,0.0009783612,0.82115716,0.00041008895,0.00010502177,0.00007351823,0.000059050923,0.00014984138,0.006715508],"genre_scores_gemma":[0.9607038,0.00050398894,0.037445303,0.00007529496,0.00009409357,0.00003411807,0.000031815678,0.00003778659,0.0010737348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.0002681371,0.000022710028,0.000103524544,0.00013011202,0.00017966011],"domain_scores_gemma":[0.99653155,0.0025873533,0.00026621934,0.0002683393,0.00020242335,0.00014412825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019501388,0.00077233097,0.0008661952,0.00033380758,0.0006220123,0.0010031315,0.0009969923,0.0005523499,0.0010305498],"category_scores_gemma":[0.0056972327,0.00030583664,0.0004613925,0.0006103759,0.001118809,0.0017633203,0.00078204577,0.0009799704,0.00012671323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053028252,0.000034051613,0.00059062056,0.000040752428,0.000016848093,0.00016538406,0.000042366282,0.9720871,0.0025247908,0.014807487,0.00027779545,0.0093598515],"study_design_scores_gemma":[0.0000056278304,0.000026587752,0.00014459365,0.000004102956,0.000006391091,0.000015121893,0.000025413508,0.9921916,0.0006457424,0.0066983723,0.00023293041,0.000003524242],"about_ca_topic_score_codex":0.006109254,"about_ca_topic_score_gemma":0.0052248226,"teacher_disagreement_score":0.006109254,"about_ca_system_score_codex":0.0010200493,"about_ca_system_score_gemma":0.0010423195,"threshold_uncertainty_score":0.012147427},"labels":[],"label_agreement":null},{"id":"W1686478837","doi":"10.1109/jsac.2015.2430280","title":"Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization 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":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Poisson distribution; Aloha; Hop (telecommunications); Node (physics); Fading; Independent and identically distributed random variables; Range (aeronautics); Probability density function; Wireless network; Wireless sensor network; Wireless; Computer network; Algorithm; Topology (electrical circuits); Random variable; Mathematics; Statistics; Telecommunications; Throughput","score_opus":0.02498286785264181,"score_gpt":0.2506566063966716,"score_spread":0.22567373854402978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1686478837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06610388,0.00062216085,0.9308926,0.0001208761,0.000028491131,0.00004699513,0.00002801552,0.000117462565,0.002039599],"genre_scores_gemma":[0.93527734,0.0008604931,0.062165067,0.000061380975,0.000058365385,0.000087774475,0.000056079098,0.000023952649,0.0014097679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803,0.000867466,0.00010230224,0.00028111515,0.0005857876,0.00013320261],"domain_scores_gemma":[0.99281424,0.0049798363,0.0010500031,0.0005305874,0.00054332893,0.00008195173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020863009,0.00037623275,0.00063630915,0.0007986085,0.0005845747,0.0010219155,0.00097424194,0.0006623441,0.00042205257],"category_scores_gemma":[0.011626673,0.00034698934,0.00039751068,0.0010527757,0.0018521476,0.0022783114,0.0009214981,0.0004063865,0.00013097882],"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.00007136799,0.000039351668,0.003102366,0.00018524942,0.00004775135,0.0003760424,0.00022487037,0.8933363,0.005428035,0.061660185,0.00033387024,0.03519472],"study_design_scores_gemma":[0.000006728086,0.000045991284,0.0005847693,0.0000057695097,0.000013278905,0.00009716894,0.00004195621,0.988427,0.0020446617,0.008328533,0.00039164122,0.000012444611],"about_ca_topic_score_codex":0.0025652228,"about_ca_topic_score_gemma":0.0014313598,"teacher_disagreement_score":0.0025652228,"about_ca_system_score_codex":0.0010417828,"about_ca_system_score_gemma":0.0007230224,"threshold_uncertainty_score":0.011033535},"labels":[],"label_agreement":null},{"id":"W1825277958","doi":"10.1109/jsac.2009.090504","title":"A secure mobile healthcare system using trust-based multicast scheme","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Multicast; Overhead (engineering); Node (physics); Mobile computing; Computer security","score_opus":0.04750095574734478,"score_gpt":0.36161966104301035,"score_spread":0.31411870529566555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1825277958","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.17610241,0.000911812,0.8137254,0.001250146,0.00019641896,0.0003420107,0.00009066643,0.0023238037,0.0050573004],"genre_scores_gemma":[0.924703,0.00018754175,0.07288447,0.00012055615,0.00006256852,0.00013924949,0.00007123423,0.0000184784,0.0018127512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.00031380914,0.00012322977,0.00013744718,0.00030772956,0.0001269319],"domain_scores_gemma":[0.9989889,0.00020631042,0.00020110139,0.00024673293,0.00022749945,0.00012942185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010925183,0.00039719304,0.00067883095,0.0006167073,0.0012604155,0.0008173679,0.0011018189,0.0014707904,0.0010497276],"category_scores_gemma":[0.0021307352,0.00021388408,0.00047668786,0.00046825444,0.00042256928,0.001595038,0.0017385979,0.00054155715,0.0003838613],"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.0031130104,0.00091652095,0.0144595485,0.0005178017,0.00040283924,0.0048467536,0.002252103,0.19557007,0.14686038,0.09579742,0.011407251,0.5238563],"study_design_scores_gemma":[0.00017585348,0.000749742,0.0013755027,0.000033940556,0.00012905172,0.0015260838,0.00014651494,0.9523597,0.017175438,0.01264428,0.013605969,0.00007784934],"about_ca_topic_score_codex":0.0010100025,"about_ca_topic_score_gemma":0.00057543634,"teacher_disagreement_score":0.0014707904,"about_ca_system_score_codex":0.00074990443,"about_ca_system_score_gemma":0.0006724291,"threshold_uncertainty_score":0.0057778955},"labels":[],"label_agreement":null},{"id":"W1970107330","doi":"10.1109/jsac.2013.sup.0513042","title":"CAH-MAC: Cooperative ADHOC MAC for Vehicular Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":139,"is_retracted":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":"Retransmission; Computer network; Computer science; Wireless ad hoc network; Network packet; Vehicular ad hoc network; Wireless; Throughput; Multiple Access with Collision Avoidance for Wireless; Channel (broadcasting); Reliability (semiconductor); Access control; Media access control; IEEE 802.11p; Telecommunications","score_opus":0.016294784109665963,"score_gpt":0.25093640557410407,"score_spread":0.23464162146443812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970107330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010659905,0.0036117665,0.9732205,0.0004348596,0.0006971758,0.000351305,0.0001920304,0.0026656296,0.008166871],"genre_scores_gemma":[0.6700862,0.0028285184,0.31072438,0.00096596574,0.0004781266,0.000876726,0.0006435913,0.00021961576,0.013176834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00018680908,0.000049648308,0.00010518749,0.0003697603,0.00012268238],"domain_scores_gemma":[0.99896514,0.00032497916,0.00011566799,0.0001729606,0.00035665778,0.00006460495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009336753,0.00081587036,0.0005813919,0.00077684317,0.00089862494,0.0010295087,0.0020693452,0.00082210195,0.0023587449],"category_scores_gemma":[0.0024788857,0.00020396107,0.00030617742,0.00077606254,0.0006840762,0.0008939872,0.0013355884,0.001047015,0.0006352015],"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.0004068302,0.00027853984,0.0012810566,0.0010469094,0.00021081549,0.0004981715,0.00042437797,0.2512097,0.03356262,0.15732689,0.053544514,0.50020957],"study_design_scores_gemma":[0.00007432289,0.00028866332,0.00035006632,0.000048862075,0.00005530434,0.0002991638,0.00006839793,0.9153336,0.008094617,0.024460277,0.05087347,0.000053311658],"about_ca_topic_score_codex":0.0034204978,"about_ca_topic_score_gemma":0.0037511257,"teacher_disagreement_score":0.0034204978,"about_ca_system_score_codex":0.0006682847,"about_ca_system_score_gemma":0.0018255787,"threshold_uncertainty_score":0.007890761},"labels":[],"label_agreement":null},{"id":"W1970767514","doi":"10.1109/jsac.2014.2328133","title":"Optimized Backhaul Compression for Uplink Cloud Radio Access Network","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":151,"is_retracted":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":"Backhaul (telecommunications); Telecommunications link; Decodes; Quantization (signal processing); Base station; Maximization; Artificial noise; Cloud computing; Decoding methods","score_opus":0.0319810831676609,"score_gpt":0.3065107223314905,"score_spread":0.2745296391638296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970767514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10400332,0.0012977603,0.8880559,0.00025927692,0.00004716676,0.00006133024,0.000071715316,0.00024177297,0.0059618545],"genre_scores_gemma":[0.9318253,0.0004972704,0.06608616,0.000064505024,0.00003381351,0.000040105362,0.000059125545,0.000032304826,0.0013615447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995245,0.00014588624,0.000013562483,0.000052799474,0.00018733485,0.00007597854],"domain_scores_gemma":[0.99938047,0.00038390275,0.00006548429,0.000043049757,0.000104696104,0.000022319995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006354171,0.00074972823,0.00059735816,0.00030687233,0.00033112455,0.00074339466,0.0005447696,0.0003912109,0.0008002365],"category_scores_gemma":[0.001485479,0.00015443432,0.00021088567,0.0007193445,0.00067154627,0.0008408365,0.0006423879,0.00056387146,0.00011443688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010430079,0.00003620576,0.0003047373,0.000045969242,0.000012881105,0.00007264618,0.000026046393,0.95181227,0.006541812,0.011222668,0.00041531518,0.029405221],"study_design_scores_gemma":[0.000003095666,0.000018769728,0.000041989766,0.0000021652534,0.0000021824956,0.000011189761,0.0000051701986,0.9976029,0.0012046848,0.0010027348,0.00010284017,0.000002291972],"about_ca_topic_score_codex":0.0033162031,"about_ca_topic_score_gemma":0.003373807,"teacher_disagreement_score":0.0033162031,"about_ca_system_score_codex":0.00088209513,"about_ca_system_score_gemma":0.0008738597,"threshold_uncertainty_score":0.006593764},"labels":[],"label_agreement":null},{"id":"W1973184571","doi":"10.1109/jsac.2013.130413","title":"Resilient Asymptotic Consensus in Robust Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":713,"is_retracted":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; Robustness (evolution); Redundancy (engineering); Distributed computing; Fault tolerance; Network topology; Computer network; Theoretical computer science","score_opus":0.03176602887918567,"score_gpt":0.2648428637459382,"score_spread":0.2330768348667525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973184571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035461087,0.00075184216,0.95672303,0.00035465567,0.00004643458,0.000039827104,0.000057378,0.0003824848,0.006183238],"genre_scores_gemma":[0.9502787,0.00086389075,0.046181824,0.00010459406,0.00013376304,0.00013270866,0.00010221841,0.0000772182,0.002125161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819237,0.00058055227,0.00009877792,0.00039168115,0.0005931074,0.00014355282],"domain_scores_gemma":[0.99500185,0.0031494265,0.00085244403,0.0004650375,0.00042472294,0.00010645104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444277,0.00069235027,0.00074450235,0.0012138983,0.00047528627,0.0010478636,0.0011754083,0.0010872625,0.00096850825],"category_scores_gemma":[0.009727268,0.00036448252,0.0006231634,0.00089851534,0.0018446697,0.0019718918,0.0017601446,0.0009363131,0.00027541694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008158521,0.000024182777,0.00056886306,0.00015183756,0.000073969095,0.0002960864,0.00015903535,0.7934494,0.0066066626,0.17919314,0.0006323016,0.018762898],"study_design_scores_gemma":[0.00001470808,0.00006586658,0.00015777654,0.000014779734,0.00001599737,0.00008616443,0.00002809565,0.8749155,0.0019055684,0.121385776,0.0013960542,0.000013791056],"about_ca_topic_score_codex":0.00093026645,"about_ca_topic_score_gemma":0.00038583198,"teacher_disagreement_score":0.001444277,"about_ca_system_score_codex":0.00095542596,"about_ca_system_score_gemma":0.00045321186,"threshold_uncertainty_score":0.0076381564},"labels":[],"label_agreement":null},{"id":"W1975217603","doi":"10.1109/jsac.2003.818801","title":"Multicast With Network Coding in Application-Layer Overlay Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":139,"is_retracted":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; Multicast; Computer network; Linear network coding; Overlay network; Distributed computing; Overlay multicast; Network topology; Source-specific multicast; Multicast address; The Internet; Network packet","score_opus":0.025380861361016666,"score_gpt":0.2846143062362388,"score_spread":0.25923344487522215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975217603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026993014,0.00038550585,0.9671748,0.00024043367,0.000031208558,0.00006198341,0.00002713899,0.0003550686,0.004730884],"genre_scores_gemma":[0.66562694,0.0005711259,0.33112586,0.00012072283,0.000062909494,0.00019260659,0.00006755069,0.00005853713,0.002173762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998691,0.000650533,0.000043457567,0.00007294339,0.0004344779,0.00010762192],"domain_scores_gemma":[0.9966709,0.002136027,0.00020196589,0.00048807304,0.00043695417,0.000065999535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688457,0.0003954798,0.0003546753,0.00078221125,0.00061863824,0.00088867114,0.00084784924,0.00072660035,0.00074381946],"category_scores_gemma":[0.006872055,0.00022746937,0.00024643575,0.001101749,0.0011694295,0.0019604007,0.0013127557,0.00093919365,0.00015569021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016378178,0.000067919165,0.0006422141,0.000117875825,0.000020617445,0.00016547204,0.00028318647,0.6735118,0.010278092,0.2248954,0.0016682169,0.088185385],"study_design_scores_gemma":[0.000011795177,0.000036770733,0.00007689514,0.000013514664,0.000005871664,0.000056661574,0.000022465756,0.9414737,0.0029302868,0.05360977,0.0017538858,0.000008368908],"about_ca_topic_score_codex":0.0021039916,"about_ca_topic_score_gemma":0.0018056682,"teacher_disagreement_score":0.0021039916,"about_ca_system_score_codex":0.0011255741,"about_ca_system_score_gemma":0.0011105684,"threshold_uncertainty_score":0.008929491},"labels":[],"label_agreement":null},{"id":"W1981779732","doi":"10.1109/jsac.2015.2391892","title":"On the Performance of Overlaid Wireless Sensor Transmission with RF Energy Harvesting","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","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":"University of Victoria","funders":"","keywords":"Computer science; Energy harvesting; Wireless sensor network; Rayleigh fading; Network packet; Transmission (telecommunications); Transmission delay; Wireless; Electronic engineering; Energy (signal processing); Fading; Computer network; Channel (broadcasting); Telecommunications; Engineering; Physics","score_opus":0.02710987502300357,"score_gpt":0.2327598879008301,"score_spread":0.20565001287782653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981779732","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.9210658,0.0011145951,0.071900256,0.00020435084,0.000034359527,0.000028659988,0.000117453616,0.00021502432,0.0053194202],"genre_scores_gemma":[0.9969054,0.00022402618,0.002412529,0.000024714038,0.000006096432,0.000009069945,0.000034028144,0.000010993689,0.0003731762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925154,0.00018287847,0.000031777694,0.00011296026,0.000263169,0.00015761532],"domain_scores_gemma":[0.99632275,0.0023897518,0.0003980305,0.00025889953,0.00056002516,0.000070573886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081520004,0.000587857,0.00051159307,0.0003114966,0.00031497894,0.0005855547,0.0006831185,0.00057974266,0.0010051994],"category_scores_gemma":[0.005460303,0.00015182846,0.0002427549,0.00070539315,0.00088277325,0.0012867594,0.00081354834,0.00041380257,0.00014854215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078865036,0.00012421745,0.0022477477,0.00020131623,0.00007312346,0.00031859247,0.00017449571,0.9175124,0.0530253,0.004605978,0.00039837832,0.020529713],"study_design_scores_gemma":[0.000012179857,0.00040875416,0.001994564,0.000018524073,0.00004010961,0.00016760749,0.00012376222,0.97466516,0.020733934,0.0015912903,0.00022112967,0.000022902137],"about_ca_topic_score_codex":0.0021021604,"about_ca_topic_score_gemma":0.001732981,"teacher_disagreement_score":0.0021021604,"about_ca_system_score_codex":0.00058448775,"about_ca_system_score_gemma":0.00048180862,"threshold_uncertainty_score":0.004311204},"labels":[],"label_agreement":null},{"id":"W1984516181","doi":"10.1109/jsac.2005.858887","title":"A novel dynamic cell configuration scheme in next-generation situation-aware CDMA networks","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 British Columbia","funders":"","keywords":"Computer science; Code division multiple access; Handover; Computer network; Cellular network; Power control; Scheme (mathematics); Radio resource management; Soft handover; Reinforcement learning; Resource management (computing); Resource allocation; Call Admission Control; Distributed computing; Power (physics); Wireless network; Wireless; Telecommunications","score_opus":0.07301597889334246,"score_gpt":0.3232270380317744,"score_spread":0.2502110591384319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984516181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11032232,0.0004360154,0.8847242,0.00022577422,0.00012899068,0.00015440886,0.000031783096,0.0008129186,0.0031636115],"genre_scores_gemma":[0.89183974,0.00008977018,0.10684907,0.00010966018,0.000037649766,0.000093970026,0.000033189353,0.00001829813,0.0009286413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994041,0.00021285123,0.00003115224,0.000118873126,0.0001519106,0.00008119256],"domain_scores_gemma":[0.998965,0.00029554265,0.00011983715,0.000245157,0.00022283701,0.00015161422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549314,0.00031918657,0.00047199006,0.00036392157,0.00068960566,0.00043779993,0.0015706373,0.0006346884,0.00063385145],"category_scores_gemma":[0.002567769,0.00021345667,0.00018447843,0.00037303704,0.00077622087,0.00091795303,0.0009744239,0.00059698615,0.000219854],"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.0005813812,0.00045084028,0.004659031,0.0001212186,0.0001214549,0.00084122375,0.00092180405,0.31738937,0.09117983,0.046876386,0.0036416703,0.53321576],"study_design_scores_gemma":[0.000070602975,0.00024746952,0.00093526655,0.00001301406,0.00003255624,0.00070156396,0.00005908569,0.9769031,0.00978608,0.006892867,0.004300731,0.00005765173],"about_ca_topic_score_codex":0.0011715479,"about_ca_topic_score_gemma":0.0014105701,"teacher_disagreement_score":0.0015706373,"about_ca_system_score_codex":0.0005289491,"about_ca_system_score_gemma":0.0005019105,"threshold_uncertainty_score":0.0039925575},"labels":[],"label_agreement":null},{"id":"W1984924886","doi":"10.1109/jsac.2013.131209","title":"A Framework for Cooperative Resource Management in Mobile Cloud Computing","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":207,"is_retracted":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; Cloud computing; Service provider; Mobile cloud computing; Resource management (computing); Resource allocation; Revenue; Mobile computing; Resource (disambiguation); Service (business); Business; Computer network; Marketing","score_opus":0.029881076184516287,"score_gpt":0.3075594451869847,"score_spread":0.2776783690024684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984924886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016067545,0.0004465623,0.9866828,0.0007353926,0.0001510149,0.00019214237,0.000046202647,0.0002045378,0.0099346815],"genre_scores_gemma":[0.20745803,0.0011843898,0.77830535,0.00040716253,0.00032116653,0.001218523,0.00017280469,0.00013371382,0.010798894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774027,0.0008457844,0.0001252791,0.00026800888,0.00071234105,0.00030833136],"domain_scores_gemma":[0.9990213,0.00035607096,0.00008233977,0.00016741372,0.00019835266,0.00017454753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034225986,0.0009936406,0.0010779867,0.00081964146,0.0022073677,0.0030754046,0.0040561715,0.0021568893,0.0043951375],"category_scores_gemma":[0.0033561254,0.0006802723,0.0017530374,0.0014954524,0.0021719434,0.0034612303,0.0046210005,0.0030602175,0.0010284377],"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.000020599862,0.000041852934,0.000100965706,0.00006492171,0.000024565901,0.00022693163,0.00020428181,0.078657754,0.0006523479,0.903049,0.0039995788,0.012957184],"study_design_scores_gemma":[0.000052119725,0.000041534608,0.000065212065,0.000056433328,0.000025275349,0.00016220969,0.00009661149,0.6575,0.00042530787,0.30041885,0.041124634,0.00003180244],"about_ca_topic_score_codex":0.008255642,"about_ca_topic_score_gemma":0.008748654,"teacher_disagreement_score":0.008255642,"about_ca_system_score_codex":0.0024367895,"about_ca_system_score_gemma":0.003606085,"threshold_uncertainty_score":0.018100679},"labels":[],"label_agreement":null},{"id":"W1987844856","doi":"10.1109/jsac.2014.2384331","title":"Delay Optimization and Cross-Layer Design in Multihop Wireless Networks With Network Coding and Successive Interference Cancelation","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Concordia University","funders":"","keywords":"Computer science; Quality of service; Computer network; Network packet; Wireless network; Scheduling (production processes); Time division multiple access; Linear network coding; Wireless; Mathematical optimization; Telecommunications","score_opus":0.04377820636257169,"score_gpt":0.3051203125412626,"score_spread":0.2613421061786909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987844856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031278655,0.0007533441,0.9643385,0.00015811459,0.000047621797,0.000047242866,0.000018026718,0.00012404923,0.0032343334],"genre_scores_gemma":[0.8506542,0.00084921654,0.1450145,0.0001186342,0.000056592,0.00020068735,0.00003908598,0.00006727161,0.0029998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00021195112,0.000022366132,0.000083868,0.00020279213,0.00007930911],"domain_scores_gemma":[0.9991928,0.0004365809,0.00013580454,0.000030315849,0.0001735612,0.000031017014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012108997,0.0008281427,0.00042502457,0.00044863473,0.00033985768,0.0008170397,0.00079384143,0.0004913487,0.0009234568],"category_scores_gemma":[0.0018736342,0.0004741103,0.000341567,0.00045082605,0.00069126184,0.00073446054,0.0008024303,0.00058331824,0.00015868993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036143232,0.000022813998,0.000187486,0.00005123857,0.00002013839,0.000038012433,0.00003609329,0.9728448,0.0042437473,0.006660151,0.00021830632,0.015641188],"study_design_scores_gemma":[0.0000063015354,0.00004131657,0.000039845774,0.0000031920833,0.0000058732567,0.000009381697,0.0000064086435,0.99732375,0.0009406388,0.0013698391,0.00024984847,0.000003537286],"about_ca_topic_score_codex":0.0027329235,"about_ca_topic_score_gemma":0.00307662,"teacher_disagreement_score":0.0027329235,"about_ca_system_score_codex":0.0010118783,"about_ca_system_score_gemma":0.0011976132,"threshold_uncertainty_score":0.0073417425},"labels":[],"label_agreement":null},{"id":"W1990774782","doi":"10.1109/jsac.2010.100101","title":"Recent advances in autonomic communications [Guest Editorial","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Service-Oriented Architecture and Web Services","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 Waterloo","funders":"","keywords":"Computer science; Focus (optics); Resource management (computing); Telecommunications; Computer network","score_opus":0.015990908525128338,"score_gpt":0.29702940968323,"score_spread":0.28103850115810164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990774782","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016521473,0.035250213,0.0004273672,0.0415703,0.9168555,0.00001516163,0.00003923161,0.00007960575,0.0055974135],"genre_scores_gemma":[0.001199329,0.026765073,0.0001639777,0.011857963,0.9541223,0.000010925754,0.000028843951,0.00002869738,0.005822859],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980666,0.00025899307,0.00024466682,0.00036423764,0.0008627316,0.00020279163],"domain_scores_gemma":[0.9877067,0.004326281,0.0007431688,0.00034805754,0.0051038507,0.0017718992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033015232,0.0012294791,0.0015036623,0.0016866969,0.0011435781,0.0053423205,0.0016753346,0.005076768,0.014396693],"category_scores_gemma":[0.01330261,0.00049812166,0.00074381236,0.0012373244,0.0012962562,0.003107429,0.000998567,0.0088332,0.0071809296],"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.00006901904,0.00002471437,0.000080854355,0.00043339987,0.000020926182,0.00020271861,0.000028120505,0.000071041315,0.000187695,0.001833856,0.95444244,0.042605225],"study_design_scores_gemma":[0.000023109822,0.00004006851,0.00028764986,0.00028813805,0.000027394744,0.00035654244,0.00003283932,0.00011095148,0.00012327137,0.0019499954,0.9967449,0.000015257117],"about_ca_topic_score_codex":0.00036284162,"about_ca_topic_score_gemma":0.00069241266,"teacher_disagreement_score":0.014396693,"about_ca_system_score_codex":0.0010018689,"about_ca_system_score_gemma":0.00087198697,"threshold_uncertainty_score":0.048161745},"labels":[],"label_agreement":null},{"id":"W1993624957","doi":"10.1109/jsac.2012.1200501","title":"Guest Editorial Broadband Wireless Communications for High Speed Vehicles","year":2012,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"Concordia University","funders":"","keywords":"Computer science; Wireless; Wireless broadband; Broadband; Telecommunications; Physical layer; Computer network; Broadband networks; Radio resource management; Channel (broadcasting); Radio channel; Wireless network","score_opus":0.018559160277803147,"score_gpt":0.27629881620928554,"score_spread":0.2577396559314824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993624957","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057003297,0.003929134,0.00018862188,0.020828316,0.97309303,0.000014799983,0.000043470536,0.000047314574,0.0017981827],"genre_scores_gemma":[0.0005225598,0.00409732,0.00009300526,0.0085721705,0.97430044,0.000015346579,0.000028808034,0.000028581477,0.012341718],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819297,0.00021891207,0.0001979502,0.00028357925,0.00093112496,0.00017547287],"domain_scores_gemma":[0.99196774,0.0020087478,0.0006343051,0.0001793597,0.003902623,0.0013071425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026378979,0.0027344925,0.0024453262,0.002225942,0.0016000378,0.005070153,0.0019391378,0.008678192,0.014086365],"category_scores_gemma":[0.007849046,0.0007456761,0.0013711029,0.0009383628,0.0010231613,0.0028814797,0.0010666877,0.011249657,0.013285816],"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.00006250258,0.000015418937,0.000025536898,0.00016818116,0.000011721262,0.00016446848,0.0000053947356,0.000038008417,0.00013023923,0.000290914,0.9900921,0.008995592],"study_design_scores_gemma":[0.000048956863,0.000054200435,0.00024191635,0.00022911344,0.000032165783,0.0003306081,0.00002102374,0.00019267306,0.00021185307,0.0006523969,0.9979699,0.000015078963],"about_ca_topic_score_codex":0.00047991646,"about_ca_topic_score_gemma":0.0011716628,"teacher_disagreement_score":0.014086365,"about_ca_system_score_codex":0.0011471114,"about_ca_system_score_gemma":0.0011714029,"threshold_uncertainty_score":0.04712361},"labels":[],"label_agreement":null},{"id":"W1993753913","doi":"10.1109/jsac.2012.120608","title":"Adaptive Communication-Constrained Deployment of Unmanned Vehicle Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Distributed Control Multi-Agent Systems","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Overhead (engineering); Software deployment; Network packet; Distributed computing; Wireless; Wireless network; Robot; Mobile robot; Real-time computing; Computer network; Artificial intelligence; Telecommunications","score_opus":0.043064034559626825,"score_gpt":0.28720141255050674,"score_spread":0.24413737799087992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993753913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07134954,0.0003271781,0.9238254,0.0002674449,0.000037827176,0.00005581816,0.00003361147,0.00022532507,0.0038778824],"genre_scores_gemma":[0.94072926,0.00019263466,0.057383835,0.000054667802,0.000020524489,0.00009593857,0.000045441386,0.00003027713,0.001447334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.00018370424,0.000012337171,0.000059298385,0.00007957144,0.000045452907],"domain_scores_gemma":[0.99947673,0.00027714905,0.00009319113,0.000037757185,0.00008086192,0.00003430868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005912348,0.000550257,0.00048817068,0.0002593743,0.00028158806,0.000384937,0.000650103,0.00041858834,0.0005699859],"category_scores_gemma":[0.0021353278,0.00040918874,0.00015106138,0.00026658433,0.0004643664,0.0007042294,0.00086792646,0.0004329199,0.00011874018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001882609,0.000007893104,0.00012985642,0.00001425543,0.0000061250244,0.00002138753,0.000019029847,0.9899385,0.0008519165,0.0026697575,0.00018057875,0.0061419643],"study_design_scores_gemma":[0.0000035436874,0.000010100631,0.00004967241,0.0000014715874,0.000001124938,0.0000030859082,0.0000042733864,0.9987381,0.0001634936,0.0008488345,0.00017504842,0.0000012521616],"about_ca_topic_score_codex":0.0040310724,"about_ca_topic_score_gemma":0.0033211317,"teacher_disagreement_score":0.0040310724,"about_ca_system_score_codex":0.00054882804,"about_ca_system_score_gemma":0.0006129906,"threshold_uncertainty_score":0.008015215},"labels":[],"label_agreement":null},{"id":"W1996977547","doi":"10.1109/jsac.2013.130816","title":"Buffer-Aided Relaying with Adaptive Link Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":245,"is_retracted":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; Computer science; Computer network; Throughput; Channel state information; Relay channel; Transmission (telecommunications); Queue; Link Access Procedure for Frame Relay; Upper and lower bounds; Schedule; Selection (genetic algorithm); Power (physics); Wireless; Telecommunications; Mathematics","score_opus":0.07297752707014883,"score_gpt":0.31019186475112437,"score_spread":0.23721433768097555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996977547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14843272,0.0012213317,0.84604394,0.00025642823,0.00008525817,0.00010560138,0.00006655751,0.0002958862,0.0034922448],"genre_scores_gemma":[0.9405249,0.00049126387,0.057349555,0.000054118886,0.000033720546,0.000069177404,0.000036691665,0.000011047841,0.0014294795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00018892612,0.000030788146,0.00009500689,0.00011432772,0.000063482395],"domain_scores_gemma":[0.9987704,0.00072890177,0.00017968658,0.00013538309,0.00015360133,0.000032041746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091537344,0.00077921903,0.0005445329,0.00040527695,0.00030878608,0.00074823154,0.0012975786,0.00070108083,0.00054682087],"category_scores_gemma":[0.0025485624,0.00023059729,0.00031815207,0.0004782193,0.00055616495,0.0015387426,0.00060231227,0.0003578538,0.00012828471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031765626,0.00010386054,0.00097400934,0.00015017031,0.00008163303,0.00059343176,0.00018450595,0.86284107,0.032003894,0.059847668,0.00056468026,0.042337492],"study_design_scores_gemma":[0.000042697153,0.00016967377,0.00013861756,0.0000073660344,0.000039122337,0.00016240985,0.000016186796,0.98474264,0.005958272,0.0077963984,0.0009067345,0.000019892334],"about_ca_topic_score_codex":0.0012980334,"about_ca_topic_score_gemma":0.001656082,"teacher_disagreement_score":0.0012980334,"about_ca_system_score_codex":0.0006021547,"about_ca_system_score_gemma":0.00069010694,"threshold_uncertainty_score":0.0048410296},"labels":[],"label_agreement":null},{"id":"W1998892986","doi":"10.1109/jsac.2013.130815","title":"Relay Selection and Performance Analysis in Multiple-User Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","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":"University of Alberta","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Quadratic equation; Signal-to-noise ratio (imaging); Computational complexity theory; Scheme (mathematics); Computer network; Mathematical optimization; Algorithm; Telecommunications; Mathematics; Power (physics); Artificial intelligence","score_opus":0.04608209517420501,"score_gpt":0.2970217211579288,"score_spread":0.25093962598372377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998892986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513337,0.0038399743,0.9329534,0.0004895489,0.000065030894,0.00007032474,0.000104711246,0.00025610928,0.0108871],"genre_scores_gemma":[0.9560942,0.0029672242,0.037596345,0.00008904547,0.00018767711,0.00011126098,0.00008547141,0.000048874434,0.0028198212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747807,0.001217362,0.000079463854,0.00027809374,0.00069650094,0.0002506308],"domain_scores_gemma":[0.9942154,0.0042985464,0.00047923505,0.00025083014,0.0006653939,0.000090564565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560508,0.0013507303,0.001212138,0.0009507612,0.0006295366,0.001626275,0.001036185,0.0010106965,0.0022691654],"category_scores_gemma":[0.011301856,0.00056962715,0.00043028116,0.0016286589,0.0013192847,0.0022452136,0.001140746,0.0007204325,0.0005001985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008254581,0.000021496018,0.00072010193,0.00013365505,0.000035334968,0.00019283548,0.00011801755,0.9206931,0.0021876937,0.0584439,0.00074135314,0.016630024],"study_design_scores_gemma":[0.0000050150143,0.000046693905,0.00021473298,0.000011547603,0.000010213589,0.000095538955,0.000023050814,0.9875086,0.0004973488,0.011108787,0.0004678881,0.000010613628],"about_ca_topic_score_codex":0.0023800682,"about_ca_topic_score_gemma":0.0012843381,"teacher_disagreement_score":0.002560508,"about_ca_system_score_codex":0.0017031052,"about_ca_system_score_gemma":0.00072852516,"threshold_uncertainty_score":0.01354146},"labels":[],"label_agreement":null},{"id":"W2002724791","doi":"10.1109/jsac.2014.140411","title":"A Real-Time Adaptive Algorithm for Video Streaming over Multiple Wireless Access Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Computer network; Quality of service; Video quality; Codec; Wireless network; Wireless; Testbed; Real-time computing; Transcoding; Computer hardware; Telecommunications","score_opus":0.018611517232122926,"score_gpt":0.27596832161287843,"score_spread":0.2573568043807555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002724791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121977925,0.0003021376,0.9853894,0.00012927719,0.00006359901,0.00007244037,0.000012521225,0.00026088223,0.0015719348],"genre_scores_gemma":[0.68523,0.0004950174,0.3102062,0.00015311207,0.00009165001,0.00037902323,0.00007007762,0.00005268978,0.0033222332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00010083911,0.000020029413,0.00007955955,0.00011921317,0.00004442944],"domain_scores_gemma":[0.99934024,0.0004083878,0.000076822536,0.000027794,0.000113446185,0.00003327477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088596786,0.00073970377,0.0006449816,0.0003889828,0.00041207153,0.0004429935,0.0010374058,0.0008307821,0.0015567939],"category_scores_gemma":[0.0026344552,0.00019638329,0.0003625277,0.00042786406,0.0005178351,0.0005940639,0.0005254028,0.0011841774,0.00023501256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010463902,0.00008453835,0.00035523679,0.00005698823,0.00002950944,0.000058626007,0.000046497003,0.8871881,0.0036085628,0.0079517495,0.0009400211,0.09957557],"study_design_scores_gemma":[0.0000074009276,0.000021880429,0.000024215686,0.0000014297361,0.0000020908847,0.0000087375065,0.000001834442,0.99916077,0.00018667204,0.00042012788,0.0001630902,0.0000018159114],"about_ca_topic_score_codex":0.0039057825,"about_ca_topic_score_gemma":0.0028696614,"teacher_disagreement_score":0.0039057825,"about_ca_system_score_codex":0.00055583,"about_ca_system_score_gemma":0.0010632033,"threshold_uncertainty_score":0.007766068},"labels":[],"label_agreement":null},{"id":"W2016303810","doi":"10.1109/jsac.2013.130320","title":"Service Response Time of Elastic Data Traffic in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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 Waterloo","funders":"","keywords":"Computer science; Preemption; Quality of service; Computer network; Response time; Service (business); Data as a service; Channel (broadcasting); Processor sharing; Operating system; Queueing theory","score_opus":0.04094177913332953,"score_gpt":0.29173299051919094,"score_spread":0.2507912113858614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016303810","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.8962599,0.00076060113,0.1002945,0.00027602082,0.00005730649,0.000022905888,0.000060375634,0.0002513124,0.0020170268],"genre_scores_gemma":[0.99858177,0.000069694484,0.0011159882,0.000021341351,0.000008624395,0.000007779539,0.000014984846,0.0000131725865,0.0001666109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998938,0.0002109812,0.000034531095,0.00016984307,0.00034207146,0.00030446207],"domain_scores_gemma":[0.9940838,0.0041610827,0.0007721566,0.00023526177,0.00055465894,0.00019301916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017048481,0.00052702334,0.00054713106,0.0007047612,0.0004491756,0.0007930785,0.0007044255,0.00059197855,0.00056499155],"category_scores_gemma":[0.008793777,0.00023803735,0.0003987405,0.0006562277,0.00088576984,0.0007149755,0.00052066165,0.0008691744,0.000114104754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072713353,0.00011744432,0.0053918203,0.00010865139,0.000067682806,0.00031550936,0.0001858201,0.9478408,0.02387125,0.007996064,0.0005257196,0.012852169],"study_design_scores_gemma":[0.00000808613,0.000057138448,0.0010883049,0.0000036856345,0.000011230955,0.00005105978,0.00004215991,0.99556065,0.0016810686,0.0014115358,0.00007579432,0.000009312282],"about_ca_topic_score_codex":0.0046221297,"about_ca_topic_score_gemma":0.0019286841,"teacher_disagreement_score":0.0046221297,"about_ca_system_score_codex":0.0018142808,"about_ca_system_score_gemma":0.00108457,"threshold_uncertainty_score":0.013163567},"labels":[],"label_agreement":null},{"id":"W2020534110","doi":"10.1109/jsac.2014.2358832","title":"Efficient Methods for Early Protocol Identification","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Internet Traffic Analysis and Secure E-voting","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":"Computer science; Network packet; Byte; Deep packet inspection; Memory footprint; Payload (computing); Traffic classification; Computer network; File sharing; Set (abstract data type); Identification (biology); Distributed computing; Real-time computing; The Internet; Operating system","score_opus":0.04083046128720494,"score_gpt":0.38107302182072805,"score_spread":0.3402425605335231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020534110","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.001385352,0.0004199934,0.9955401,0.00010391443,0.000094157534,0.00007768134,0.00009402759,0.0011235668,0.0011612747],"genre_scores_gemma":[0.07658629,0.0009015287,0.91028523,0.00014986724,0.0002912673,0.00054671353,0.00080180174,0.00051153876,0.00992579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951762,0.0012838631,0.00030681508,0.00091486756,0.0019608461,0.00035748366],"domain_scores_gemma":[0.98864055,0.005634699,0.00090135576,0.0024259305,0.0022280365,0.0001694578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035258452,0.0022894528,0.0019448422,0.0048307944,0.0012632025,0.0032363075,0.0037250908,0.0023772924,0.009278019],"category_scores_gemma":[0.01944141,0.0011062503,0.0012896691,0.0030697014,0.0013758228,0.005213252,0.0036189728,0.0038267623,0.008165331],"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.00026652456,0.00020060719,0.0014188057,0.00039264548,0.00008920518,0.0000937861,0.00016286493,0.077682205,0.012240696,0.09836799,0.01200205,0.7970827],"study_design_scores_gemma":[0.000047378166,0.00006211253,0.0005306474,0.00006184937,0.000030953262,0.00019547902,0.000059431477,0.8637728,0.008894232,0.11202443,0.014262773,0.000057856],"about_ca_topic_score_codex":0.0015934911,"about_ca_topic_score_gemma":0.0015976789,"teacher_disagreement_score":0.009278019,"about_ca_system_score_codex":0.001263921,"about_ca_system_score_gemma":0.002576044,"threshold_uncertainty_score":0.031038105},"labels":[],"label_agreement":null},{"id":"W2024304958","doi":"10.1109/jsac.2013.131130","title":"Cooperative Spectrum Access Towards Secure Information Transfer for CRNs","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":143,"is_retracted":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; Relay; Computer network; Secrecy; Transmission (telecommunications); Secure transmission; Beamforming; Jamming; Cognitive radio; Computer security; Power (physics); Telecommunications; Wireless","score_opus":0.030423715984027086,"score_gpt":0.29916438916850957,"score_spread":0.26874067318448247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024304958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019380515,0.00086846703,0.97100925,0.00022496298,0.000047505066,0.000049673523,0.000013874954,0.00010753196,0.008298256],"genre_scores_gemma":[0.9427439,0.0009909011,0.05332111,0.00014112594,0.00006938282,0.00016081393,0.00001759594,0.000016750819,0.0025384629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884963,0.00042698305,0.000039652066,0.00019587282,0.00033758077,0.00015027962],"domain_scores_gemma":[0.9992866,0.000328324,0.00011359946,0.00009356591,0.00014290684,0.000034951492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884791,0.000751788,0.0006731036,0.00042958462,0.0005395328,0.0010645732,0.0009788587,0.000916422,0.0011393582],"category_scores_gemma":[0.0021443835,0.00029801272,0.00051275786,0.000657512,0.0014720501,0.0012182118,0.0022042298,0.0008824394,0.00025186257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017493262,0.000091958835,0.00042462413,0.0002580363,0.000067494,0.00045737528,0.0004927039,0.53784037,0.026702354,0.36882192,0.0020733415,0.06259482],"study_design_scores_gemma":[0.00001649662,0.0000743177,0.000060878585,0.000012972843,0.000012747697,0.000074694435,0.00004066736,0.95851785,0.0015303439,0.037687797,0.0019588242,0.000012404926],"about_ca_topic_score_codex":0.0011082196,"about_ca_topic_score_gemma":0.0006534253,"teacher_disagreement_score":0.0011393582,"about_ca_system_score_codex":0.000740747,"about_ca_system_score_gemma":0.00074014615,"threshold_uncertainty_score":0.005374551},"labels":[],"label_agreement":null},{"id":"W2025005414","doi":"10.1109/jsac.2014.140404","title":"Optimal Delivery of Rate-Adaptive Streams in Underprovisioned Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Dynamic Adaptive Streaming over HTTP; Content delivery network; Computer network; Context (archaeology); Quality of experience; Internet traffic; The Internet; Population; Server; Distributed computing; Quality of service; World Wide Web","score_opus":0.026122356390072193,"score_gpt":0.2589571086519255,"score_spread":0.23283475226185332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025005414","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.49767065,0.0004849781,0.49655157,0.00049592485,0.00003355479,0.00013689198,0.00019376133,0.0004295623,0.004003119],"genre_scores_gemma":[0.9762299,0.00020408796,0.022111017,0.000054376836,0.000011655098,0.000049100086,0.000056372282,0.00002875011,0.0012547908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.00034917847,0.000032955988,0.0001912739,0.00015549154,0.00019767354],"domain_scores_gemma":[0.99784184,0.0015063124,0.00029604798,0.000069292975,0.00017409855,0.00011230168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012045577,0.00063591596,0.0011637765,0.0003902209,0.0005811418,0.0015714467,0.0010450985,0.000955706,0.0009368316],"category_scores_gemma":[0.0044062003,0.0006185389,0.00031237717,0.00062889734,0.0012467947,0.0012852533,0.0008420271,0.00087409205,0.000093232666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000686988,0.00003021247,0.00025186606,0.000018254132,0.0000058855835,0.000039655526,0.00003607187,0.99360657,0.0011809021,0.0021292027,0.00012509938,0.002507565],"study_design_scores_gemma":[0.000008701016,0.000018377186,0.000050203616,0.0000012048644,0.0000019709778,0.0000052741166,0.000014635677,0.9986965,0.00025299724,0.0008965999,0.000051727897,0.0000017904929],"about_ca_topic_score_codex":0.012385377,"about_ca_topic_score_gemma":0.006870412,"teacher_disagreement_score":0.012385377,"about_ca_system_score_codex":0.0025590544,"about_ca_system_score_gemma":0.001426285,"threshold_uncertainty_score":0.024626553},"labels":[],"label_agreement":null},{"id":"W2025133448","doi":"10.1109/jsac.2013.130201","title":"Guest Editorial: Large-Scale Multiple Antenna Wireless Systems","year":2013,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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 British Columbia","funders":"","keywords":"Computer science; Focus (optics); Telecommunications; Wireless; Antenna (radio); Scale (ratio); Computer network","score_opus":0.01972504215709183,"score_gpt":0.2704536179213791,"score_spread":0.2507285757642873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025133448","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004523809,0.00231547,0.00018923175,0.015473535,0.98078394,0.000016788194,0.000043117358,0.00004699824,0.0010856726],"genre_scores_gemma":[0.0005759554,0.002747478,0.00011035154,0.00696718,0.9812401,0.000018608722,0.000033392396,0.000040370323,0.00826655],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99620074,0.00047431525,0.00045644763,0.0005316807,0.001996921,0.00033981647],"domain_scores_gemma":[0.98645973,0.003726996,0.001030943,0.0003937671,0.006358999,0.0020296322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490256,0.0034605889,0.0035988705,0.0030009402,0.0024963098,0.007184065,0.002911223,0.010661093,0.0147957755],"category_scores_gemma":[0.015255727,0.0011491418,0.0025575224,0.0013293764,0.0016976123,0.0030896803,0.001328903,0.01479387,0.012579114],"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.000056805577,0.000013791057,0.000029104514,0.00014001178,0.000019811549,0.00017331919,0.000006055599,0.000036779238,0.00010840826,0.00027095852,0.99465287,0.0044921613],"study_design_scores_gemma":[0.00010478251,0.00006600419,0.00033819774,0.00021494995,0.00006367387,0.0004504075,0.00002926026,0.00031317832,0.0003169836,0.0009798665,0.99710053,0.000022196626],"about_ca_topic_score_codex":0.00052806194,"about_ca_topic_score_gemma":0.0017903576,"teacher_disagreement_score":0.0147957755,"about_ca_system_score_codex":0.0019339775,"about_ca_system_score_gemma":0.0020232785,"threshold_uncertainty_score":0.04949683},"labels":[],"label_agreement":null},{"id":"W2028653892","doi":"10.1109/jsac.2012.120813","title":"GestureFlow: QoE-Aware Streaming of Multi-TouchGestures in Interactive Multimedia Applications","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 Toronto","funders":"","keywords":"Gesture; Computer science; Session (web analytics); Multimedia; Mobile device; Network packet; Interactive media; Protocol (science); Quality of experience; Gesture recognition; Human–computer interaction; Computer network; Artificial intelligence; Quality of service; World Wide Web","score_opus":0.05588061973757499,"score_gpt":0.34641265444898034,"score_spread":0.2905320347114054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028653892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11031233,0.0015178311,0.8757529,0.00056609506,0.00024319714,0.0008725532,0.00016828223,0.0047769994,0.0057897307],"genre_scores_gemma":[0.88506025,0.00059971464,0.10974234,0.00022316563,0.0001534487,0.0003536427,0.00020006497,0.00016102202,0.003506456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00015640775,0.000045331755,0.00009133282,0.00023464767,0.00008959942],"domain_scores_gemma":[0.99873084,0.0006029939,0.00010225659,0.00014746605,0.00029529558,0.0001212056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016028702,0.00068441784,0.000547129,0.00052043964,0.0007193242,0.0009214635,0.001055995,0.0006265888,0.0018472624],"category_scores_gemma":[0.0040877224,0.00026803015,0.00023874556,0.0004126834,0.000572498,0.0013675498,0.0013192917,0.0008181733,0.0002270767],"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.0026070166,0.00083569804,0.005271801,0.00062509044,0.00014725198,0.0010907304,0.0012060673,0.096583344,0.22759172,0.026445083,0.012241705,0.62535447],"study_design_scores_gemma":[0.00022792505,0.0010038319,0.0029546032,0.00009033108,0.00009358424,0.0006937768,0.00020815329,0.88071287,0.078438304,0.0156029975,0.019854475,0.00011907499],"about_ca_topic_score_codex":0.002549867,"about_ca_topic_score_gemma":0.0025821282,"teacher_disagreement_score":0.002549867,"about_ca_system_score_codex":0.0007121018,"about_ca_system_score_gemma":0.0009128537,"threshold_uncertainty_score":0.008476913},"labels":[],"label_agreement":null},{"id":"W2029232777","doi":"10.1109/jsac.2013.131006","title":"Two-Stage Channel Quantization for Scheduling and Beamforming in Network MIMO Systems: Feedback Design and Scaling Laws","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Computer science; MIMO; Beamforming; Base station; Precoding; Multi-user MIMO; Telecommunications link; Channel (broadcasting); Quantization (signal processing); Channel state information; Scheduling (production processes); Spatial multiplexing; Control theory (sociology); Real-time computing; Computer network; Wireless; Telecommunications; Algorithm; Mathematical optimization; Mathematics","score_opus":0.03541002289995055,"score_gpt":0.2761823023650124,"score_spread":0.24077227946506186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029232777","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.005633217,0.00033106148,0.99188507,0.00012378559,0.000028471362,0.00005060354,0.000020084135,0.00012797234,0.0017997322],"genre_scores_gemma":[0.78197783,0.00079824385,0.21420844,0.00017351762,0.00009113301,0.00027782668,0.00004817817,0.000056306228,0.0023684602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910283,0.0003118311,0.000036716603,0.000089847104,0.00038272387,0.00007615007],"domain_scores_gemma":[0.99830073,0.0010497785,0.00015012873,0.00014129958,0.0003209032,0.00003706748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015670448,0.0006540402,0.00052346947,0.00032199814,0.00045353684,0.0007654524,0.0007954285,0.00053817715,0.0017035883],"category_scores_gemma":[0.0045704567,0.00041958387,0.00021859277,0.000584765,0.00094723894,0.0012793673,0.0006666512,0.0008272203,0.00029612138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009099798,0.00007510488,0.00041696196,0.00012518764,0.000016173753,0.00006785892,0.00015187643,0.8331538,0.012212271,0.0805171,0.0015000728,0.0716726],"study_design_scores_gemma":[0.00000882909,0.000029027518,0.000048893093,0.0000065886497,0.000002462818,0.000016206848,0.0000071097284,0.99227226,0.001116886,0.0060142227,0.00046938512,0.000008231353],"about_ca_topic_score_codex":0.002669265,"about_ca_topic_score_gemma":0.0032936572,"teacher_disagreement_score":0.002669265,"about_ca_system_score_codex":0.0012556167,"about_ca_system_score_gemma":0.001195384,"threshold_uncertainty_score":0.009110153},"labels":[],"label_agreement":null},{"id":"W2031672799","doi":"10.1109/jsac.2009.090909","title":"On node density - outage probability tradeoff in wireless networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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 Ottawa","funders":"","keywords":"Fading; Computer science; Poisson distribution; Node (physics); Interference (communication); Wireless network; Coverage probability; Stochastic geometry; Channel (broadcasting); Topology (electrical circuits); Single antenna interference cancellation; Wireless; Algorithm; Mathematics; Statistics; Telecommunications","score_opus":0.05145683581558002,"score_gpt":0.30388491776213444,"score_spread":0.2524280819465544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031672799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15425846,0.006714337,0.8184533,0.0017973938,0.00015598875,0.00008436866,0.00027280473,0.0003110184,0.017952345],"genre_scores_gemma":[0.9749008,0.00507433,0.016693678,0.00021116876,0.00027221302,0.000101256905,0.000099221645,0.00008535326,0.0025619757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976476,0.0011116795,0.00005936943,0.00023575868,0.0006366186,0.0003089953],"domain_scores_gemma":[0.9835714,0.013634844,0.001096711,0.000569306,0.0008916495,0.00023597077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032258665,0.0015591163,0.0014190166,0.0017412904,0.0009653166,0.0017539264,0.0015185825,0.0016146393,0.0013413139],"category_scores_gemma":[0.01845195,0.0008050715,0.0006768862,0.0020898995,0.0024183288,0.003856433,0.0019722532,0.0014186322,0.000296118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006301423,0.00003113219,0.0011117816,0.00011331284,0.000027769247,0.00023815184,0.00013974571,0.90656084,0.0014629605,0.08295765,0.0008285707,0.006465019],"study_design_scores_gemma":[0.000005298214,0.00006065839,0.00051735196,0.000028393895,0.000016574828,0.00018757423,0.000056277688,0.9656435,0.00033055106,0.032661643,0.00046950928,0.000022754079],"about_ca_topic_score_codex":0.003442472,"about_ca_topic_score_gemma":0.002107656,"teacher_disagreement_score":0.003442472,"about_ca_system_score_codex":0.0022469822,"about_ca_system_score_gemma":0.000737631,"threshold_uncertainty_score":0.01706022},"labels":[],"label_agreement":null},{"id":"W2036334211","doi":"10.1109/jsac.2005.853791","title":"Noncoherent sequence detection receiver for Bluetooth systems","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","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; Bluetooth; Detector; Discriminator; Decoding methods; Channel (broadcasting); Interference (communication); Trellis (graph); Real-time computing; Filter (signal processing); Sequence (biology); Electronic engineering; Algorithm; Wireless; Telecommunications","score_opus":0.0650182770116756,"score_gpt":0.316506240345679,"score_spread":0.25148796333400336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036334211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017349087,0.0009079121,0.9790492,0.0002202728,0.00007622944,0.000050566974,0.00003165324,0.00020461918,0.0021104806],"genre_scores_gemma":[0.29026154,0.0013600894,0.69783306,0.00061133935,0.00032177274,0.00016410911,0.0001703996,0.000066792025,0.009210955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935955,0.00016389656,0.000043103988,0.000100761245,0.0003034754,0.000029259058],"domain_scores_gemma":[0.99933237,0.00027442444,0.000107037384,0.00008221567,0.00018045487,0.000023448858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077687023,0.0004382636,0.0005532757,0.00040476053,0.00030717705,0.0007197048,0.00075806805,0.00093405973,0.0019086929],"category_scores_gemma":[0.0019475067,0.00030828163,0.00027482805,0.00035379187,0.0003093592,0.0007455258,0.0005458598,0.00074126147,0.0012650321],"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.00041153483,0.000111859015,0.0012226768,0.000690102,0.000074975076,0.0002540492,0.00017635713,0.023994178,0.64153147,0.053884,0.001781922,0.27586693],"study_design_scores_gemma":[0.0002101959,0.0015193903,0.0017302111,0.00013747398,0.00010982531,0.0024713394,0.000052893938,0.50095415,0.4473642,0.016993089,0.028364334,0.000092881164],"about_ca_topic_score_codex":0.0001312823,"about_ca_topic_score_gemma":0.0003501656,"teacher_disagreement_score":0.0019086929,"about_ca_system_score_codex":0.00040306788,"about_ca_system_score_gemma":0.00059643766,"threshold_uncertainty_score":0.006385207},"labels":[],"label_agreement":null},{"id":"W2040631008","doi":"10.1109/jsac.2012.121015","title":"Cooperative Sensing at the MAC Level in Simple Cognitive Personal Area Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Computer network; Network packet; Node (physics); Simple (philosophy); Queueing theory; Probabilistic logic; Transmission (telecommunications); Duty cycle; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.06614913853162112,"score_gpt":0.3044748105077806,"score_spread":0.23832567197615945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040631008","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.8054079,0.00072315324,0.1890005,0.00036266254,0.000049568884,0.000095487776,0.000045711226,0.00014030481,0.0041748295],"genre_scores_gemma":[0.9962179,0.00012802282,0.00324345,0.000031265008,0.000018981877,0.000017275845,0.000004786608,0.000005296948,0.00033295192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.0005836987,0.000053337662,0.00024230547,0.00042134937,0.00041120176],"domain_scores_gemma":[0.9914158,0.006552976,0.00087756646,0.0003400129,0.00055024854,0.00026338545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029297252,0.0010160626,0.00097061024,0.0006768287,0.0008510132,0.0013907427,0.0013819548,0.0013132959,0.0006395552],"category_scores_gemma":[0.010529941,0.000628288,0.0004644983,0.0007769565,0.002730672,0.002072972,0.0014217395,0.0005926961,0.0001197137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026120833,0.00015865192,0.0018228439,0.000092656,0.000060484068,0.00023446429,0.00021352574,0.97121567,0.0066007953,0.014392502,0.00017422893,0.0047729444],"study_design_scores_gemma":[0.000020966721,0.00010705553,0.00046419192,0.0000035954286,0.00001576666,0.000037956415,0.00002601911,0.9936454,0.0005057158,0.0051138867,0.000047016936,0.000012340943],"about_ca_topic_score_codex":0.006856686,"about_ca_topic_score_gemma":0.003747097,"teacher_disagreement_score":0.006856686,"about_ca_system_score_codex":0.0016373581,"about_ca_system_score_gemma":0.0012321274,"threshold_uncertainty_score":0.015494108},"labels":[],"label_agreement":null},{"id":"W2042101093","doi":"10.1109/jsac.2014.2332112","title":"Direct Electricity Trading in Smart Grid: A Coalitional Game Analysis","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":200,"is_retracted":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":"Alexander von Humboldt-Stiftung","keywords":"Shapley value; Electricity; Computer science; Smart grid; Revenue; Electricity pricing; Electricity market; Electricity retailing; Dynamic pricing; Electricity generation; Game theory; Mathematical optimization; Grid; Microeconomics; Environmental economics; Power (physics); Business; Economics; Finance; Mathematics; Electrical engineering","score_opus":0.019832332288050432,"score_gpt":0.2504470573568902,"score_spread":0.2306147250688398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042101093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104106314,0.0006330258,0.8681089,0.0007312043,0.0001017957,0.00016286201,0.00013021147,0.00008338113,0.025942337],"genre_scores_gemma":[0.96259,0.0005232993,0.031065403,0.00011224682,0.000046336976,0.00015013725,0.00006906757,0.000028483855,0.005415041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902415,0.00048043783,0.000032768592,0.00011691363,0.00019753285,0.00014819295],"domain_scores_gemma":[0.9983273,0.0010794819,0.00017594796,0.00006150685,0.00021215118,0.00014361001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015489676,0.00093346316,0.0010866962,0.0006219637,0.00070289883,0.0015278653,0.0013434092,0.0011508617,0.002805099],"category_scores_gemma":[0.0036115563,0.0003966181,0.0011226203,0.00070471654,0.0015748424,0.0022684992,0.0015078835,0.0014598527,0.00021234284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006983203,0.00006832192,0.0008920547,0.0000647499,0.00005652058,0.00030460386,0.00014102367,0.8245003,0.0010042011,0.1650259,0.0009914711,0.006880943],"study_design_scores_gemma":[0.0000071884806,0.000012403937,0.00007936714,0.0000043614355,0.0000059888353,0.000019871004,0.000026050613,0.9810982,0.000056963563,0.018415945,0.0002680325,0.000005638903],"about_ca_topic_score_codex":0.0068453364,"about_ca_topic_score_gemma":0.004841314,"teacher_disagreement_score":0.0068453364,"about_ca_system_score_codex":0.0016999041,"about_ca_system_score_gemma":0.0016191122,"threshold_uncertainty_score":0.013610959},"labels":[],"label_agreement":null},{"id":"W2054584542","doi":"10.1109/jsac.2013.sup.0513020","title":"Effective Utilization of User Resources in PA-VoD Systems with Channel Heterogeneity","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Bandwidth (computing); Computer network; Upload; Cache; Bandwidth allocation; Quality of service; Channel allocation schemes; Provisioning; Quality of experience; Channel (broadcasting); Distributed computing; Operating system; Wireless","score_opus":0.03457848737000129,"score_gpt":0.28394113728462583,"score_spread":0.24936264991462453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054584542","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.5205066,0.0015539611,0.4715275,0.00039926797,0.000046436522,0.000097512544,0.00010455964,0.00051245315,0.005251721],"genre_scores_gemma":[0.99411535,0.000092892034,0.005511589,0.000021423539,0.0000076785755,0.000017819848,0.000014041073,0.000013426072,0.00020578399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988545,0.00034387773,0.000055193337,0.00020645822,0.00020826371,0.00033159077],"domain_scores_gemma":[0.9963291,0.0024888776,0.0002980628,0.00033852432,0.00028227933,0.00026309668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015365654,0.00067919365,0.001420662,0.00067442923,0.0010320963,0.0017822736,0.0012063627,0.00071751437,0.0005565343],"category_scores_gemma":[0.0055270414,0.0005339096,0.00025365892,0.00077625044,0.0008975827,0.0020228685,0.0015654563,0.00052998617,0.0001111504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048501615,0.00011883077,0.0057936064,0.00011828953,0.000071266884,0.0004273661,0.00025195326,0.92746085,0.012466799,0.011166052,0.0006938487,0.04094603],"study_design_scores_gemma":[0.000011289857,0.00005165776,0.00084455294,0.000005224483,0.000015686092,0.00006435507,0.000120569464,0.99293786,0.0016469028,0.00396172,0.00032788125,0.00001227197],"about_ca_topic_score_codex":0.0036142408,"about_ca_topic_score_gemma":0.0031619167,"teacher_disagreement_score":0.0036142408,"about_ca_system_score_codex":0.0011323182,"about_ca_system_score_gemma":0.00095404923,"threshold_uncertainty_score":0.008215606},"labels":[],"label_agreement":null},{"id":"W2071707134","doi":"10.1109/jsac.2004.839380","title":"Cognitive radio: brain-empowered wireless communications","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11988,"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":"Cognitive radio; Computer science; Radio resource management; Wireless; Software-defined radio; Interference (communication); Transmitter power output; Radio spectrum; Transmitter; Channel (broadcasting); Spectrum management; Telecommunications; Wireless network; Cognitive network; Metric (unit); Electromagnetic interference; Control channel; Computer network; Transmission (telecommunications); Engineering","score_opus":0.03392261928679244,"score_gpt":0.30950505400827266,"score_spread":0.27558243472148025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071707134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019503437,0.06596558,0.77463186,0.009003788,0.002300619,0.0001080063,0.00020384746,0.0031662355,0.12511662],"genre_scores_gemma":[0.67979926,0.066887714,0.18140897,0.0035759257,0.0039184205,0.00031616807,0.00031643533,0.00024858053,0.06352851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997812,0.000054086806,0.0000068770155,0.000041205898,0.00008297199,0.00003368096],"domain_scores_gemma":[0.9997322,0.00012990781,0.000024802275,0.000029715311,0.00004617116,0.000037281803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036045085,0.0005932101,0.00042861336,0.00046547988,0.00040449208,0.002108626,0.0011015104,0.001447741,0.0035210538],"category_scores_gemma":[0.0010657827,0.00016463632,0.00023323546,0.00066719466,0.0013169523,0.001991829,0.0009375835,0.0009369235,0.0013522273],"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.00017122549,0.0000954984,0.0007487443,0.0008959335,0.00009936856,0.0007027861,0.0004913753,0.018979028,0.02406976,0.40707576,0.033755247,0.5129154],"study_design_scores_gemma":[0.00007031848,0.0002846473,0.0015889059,0.00028143034,0.00008006518,0.0015726816,0.00034783373,0.10611235,0.01068667,0.5043296,0.3745593,0.000086164786],"about_ca_topic_score_codex":0.00078805257,"about_ca_topic_score_gemma":0.00075745315,"teacher_disagreement_score":0.0035210538,"about_ca_system_score_codex":0.0004175227,"about_ca_system_score_gemma":0.0004845797,"threshold_uncertainty_score":0.0117791295},"labels":[],"label_agreement":null},{"id":"W2072433332","doi":"10.1109/jsac.2004.829334","title":"Efficient On-Demand Routing for Mobile Ad Hoc Wireless Access Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","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":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Optimized Link State Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Link-state routing protocol; Zone Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.031042464260493473,"score_gpt":0.31459880225380865,"score_spread":0.2835563379933152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072433332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020006958,0.0039207754,0.9626477,0.0007444636,0.00033064844,0.00023688228,0.00012943057,0.00052904227,0.011454061],"genre_scores_gemma":[0.6699868,0.00835125,0.30162853,0.0003693628,0.0004185672,0.0003503135,0.0009530103,0.00021180965,0.017730372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993563,0.00022751521,0.000025427174,0.000044554552,0.0002883488,0.00005792076],"domain_scores_gemma":[0.99953127,0.00020089246,0.000058093552,0.00008014953,0.000105341314,0.000024220462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186418,0.00058625895,0.0005443318,0.00041959388,0.00053118984,0.0009391064,0.0013064974,0.00067104376,0.0014031456],"category_scores_gemma":[0.001369255,0.00024076816,0.00026773795,0.00068300945,0.00036334633,0.0015233982,0.0008628803,0.00048665327,0.00051738514],"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.00020460089,0.00025226077,0.0013219207,0.0010622964,0.00012318525,0.000649071,0.00021373472,0.35263285,0.029721122,0.14618003,0.017741824,0.44989717],"study_design_scores_gemma":[0.000034992685,0.00018697229,0.00049961254,0.000040143004,0.00004157918,0.00051889813,0.00012020199,0.89553446,0.0064017735,0.049220853,0.047370996,0.000029519619],"about_ca_topic_score_codex":0.00085014105,"about_ca_topic_score_gemma":0.0017052857,"teacher_disagreement_score":0.0014031456,"about_ca_system_score_codex":0.00047975226,"about_ca_system_score_gemma":0.00040880858,"threshold_uncertainty_score":0.004693985},"labels":[],"label_agreement":null},{"id":"W2075718096","doi":"10.1109/jsac.2013.sup.0513027","title":"A Naming Scheme for P2P Web Hosting","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Scalability; Single point of failure; Dynamism; Scheme (mathematics); Peer-to-peer; Overhead (engineering); Resilience (materials science); Fault tolerance; High availability; Computer network; Distributed computing; Web application; World Wide Web; Database; Operating system","score_opus":0.04386765718388657,"score_gpt":0.28839413544397535,"score_spread":0.24452647826008878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075718096","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.015659703,0.0004165827,0.9739819,0.0007394337,0.00035115663,0.00036122955,0.00008104208,0.0012688352,0.007140088],"genre_scores_gemma":[0.44800928,0.000756804,0.54229087,0.00034076424,0.0002960684,0.0006325446,0.00029481616,0.0001905993,0.0071882843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969035,0.0010793584,0.00045993674,0.0003157691,0.0010530747,0.0001884544],"domain_scores_gemma":[0.993458,0.0015607664,0.00074091804,0.0027182195,0.0012278738,0.00029428332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004111046,0.0005418719,0.0007313131,0.0010162271,0.0028722754,0.0022360513,0.002205239,0.0021047224,0.0015572802],"category_scores_gemma":[0.00855636,0.00037120684,0.0005622223,0.0012209975,0.0020108933,0.006678601,0.0028571198,0.0016846724,0.00081798155],"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.00032611974,0.00013868438,0.0012519171,0.00033554324,0.000040090887,0.0006608852,0.0009035749,0.04696328,0.038887303,0.7325893,0.009414353,0.16848896],"study_design_scores_gemma":[0.000219151,0.0005392392,0.0007386789,0.000093613715,0.0001080219,0.0020485206,0.00032506842,0.6223959,0.02881074,0.22905064,0.115416296,0.00025422132],"about_ca_topic_score_codex":0.0016781641,"about_ca_topic_score_gemma":0.0014608004,"teacher_disagreement_score":0.004111046,"about_ca_system_score_codex":0.001554182,"about_ca_system_score_gemma":0.0022268856,"threshold_uncertainty_score":0.021741569},"labels":[],"label_agreement":null},{"id":"W2076449723","doi":"10.1109/jsac.2012.120912","title":"ML-Based Channel Estimations for Non-Regenerative Relay Networks with Multiple Transmit and Receive Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Relay; Channel (broadcasting); Singular value decomposition; Transmitter; Computer science; Algorithm; Relay channel; Estimation theory; Statistics; Mathematics; Telecommunications; Power (physics); Physics","score_opus":0.05117325933936758,"score_gpt":0.3013062263809591,"score_spread":0.25013296704159155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076449723","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.010277613,0.000600633,0.9876423,0.00010429779,0.00002593146,0.000019421988,0.00004071134,0.00034958028,0.00093937555],"genre_scores_gemma":[0.7284259,0.0016640156,0.2668744,0.00013922848,0.000131121,0.000092116425,0.00024287228,0.00008927294,0.002341098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.0003905338,0.00005174435,0.0001252202,0.00029138156,0.000066854336],"domain_scores_gemma":[0.99719965,0.0018182629,0.0003019912,0.00024169919,0.0004000783,0.000038289298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013644912,0.000993282,0.0009484808,0.0006793358,0.00034669027,0.00092038204,0.00088332186,0.0006796978,0.0009928548],"category_scores_gemma":[0.0066528628,0.0004844841,0.00047506887,0.00071511214,0.0006755924,0.0021396412,0.0008426339,0.0009471231,0.0004417131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022548021,0.000038822538,0.0008522465,0.00022338015,0.00007132962,0.00016831317,0.00014707385,0.8558625,0.0097169895,0.010887634,0.001036118,0.12077006],"study_design_scores_gemma":[0.0000061799974,0.000026710055,0.0001761536,0.000010339663,0.000012211297,0.000054760076,0.000013956861,0.99437535,0.002398241,0.002574486,0.00033996438,0.000011547419],"about_ca_topic_score_codex":0.002661376,"about_ca_topic_score_gemma":0.0032614481,"teacher_disagreement_score":0.002661376,"about_ca_system_score_codex":0.00065376505,"about_ca_system_score_gemma":0.00092458504,"threshold_uncertainty_score":0.0072161555},"labels":[],"label_agreement":null},{"id":"W2077671410","doi":"10.1109/jsac.2011.111201","title":"Guest Editorial Advances in Military Networking and Communications","year":2011,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.023615141549841397,"score_gpt":0.29323134056634337,"score_spread":0.26961619901650197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077671410","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003548656,0.0033177987,0.0000932229,0.015015879,0.9803782,0.000011078091,0.000021367636,0.000027862434,0.0010992154],"genre_scores_gemma":[0.00033332958,0.0025390694,0.000058837988,0.006266172,0.98452073,0.000013000226,0.000015332142,0.000020293299,0.0062331767],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956797,0.0005858782,0.0005029493,0.00057410344,0.002189106,0.0004683777],"domain_scores_gemma":[0.9834978,0.004303786,0.0015479526,0.00045729493,0.0069794087,0.0032137579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054035187,0.0042940006,0.004021187,0.0048558344,0.0027078835,0.0072225607,0.0023800828,0.012141374,0.019005252],"category_scores_gemma":[0.017387832,0.0011731867,0.0020721368,0.0015911252,0.0019032148,0.003288158,0.0023233802,0.014032823,0.013050078],"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.000043835124,0.000013398953,0.00002933189,0.00019685319,0.00001708149,0.00020403675,0.000008219223,0.000029117535,0.00011113129,0.00026889067,0.9913526,0.0077254223],"study_design_scores_gemma":[0.000065153996,0.0000467314,0.00028018258,0.0002972691,0.00006390971,0.0005047446,0.000033691093,0.00017807908,0.00018889918,0.00081733585,0.9975044,0.000019630355],"about_ca_topic_score_codex":0.0004724444,"about_ca_topic_score_gemma":0.0017210298,"teacher_disagreement_score":0.019005252,"about_ca_system_score_codex":0.0022021197,"about_ca_system_score_gemma":0.0021547743,"threshold_uncertainty_score":0.063578844},"labels":[],"label_agreement":null},{"id":"W2079469875","doi":"10.1109/jsac.2013.130324","title":"Designing Two-Dimensional Spectrum Auctions for Mobile Secondary Users","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Calgary; University of Toronto","funders":"","keywords":"Spectrum auction; Computer science; Common value auction; Computer network; Frequency allocation; Secondary market; Channel (broadcasting); Externality; Combinatorial auction; Channel allocation schemes; Scarcity; Spectrum management; Microeconomics; Telecommunications; Cognitive radio; Business; Auction theory; Wireless; Economics; Revenue equivalence","score_opus":0.08597836975112576,"score_gpt":0.384071683422099,"score_spread":0.29809331367097325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079469875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08050279,0.00021308704,0.90884465,0.00040170678,0.000063796506,0.0002948329,0.000053572498,0.00016411189,0.009461494],"genre_scores_gemma":[0.89499944,0.00020149087,0.10080306,0.00012033359,0.00004533127,0.00028620835,0.000034710913,0.00002998215,0.003479402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968466,0.001730836,0.00017364912,0.00031782236,0.0005034076,0.00042771388],"domain_scores_gemma":[0.9960847,0.0020625584,0.00054399745,0.00045564445,0.0004702824,0.00038276828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042330883,0.0009949224,0.0015674387,0.00050568476,0.0007164754,0.0035903275,0.0020869789,0.0013905724,0.002492973],"category_scores_gemma":[0.008162445,0.0008380561,0.0010823754,0.00075535197,0.0015008171,0.002367759,0.0026988857,0.0014232289,0.0005588772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053390703,0.00047869937,0.0019586415,0.00026365765,0.00014971272,0.0009070089,0.00038217302,0.70340204,0.013132452,0.2492789,0.0021939666,0.02731893],"study_design_scores_gemma":[0.00007333162,0.00010291652,0.000109564,0.00000973669,0.000015061509,0.00014769947,0.00007424119,0.9701735,0.0008459844,0.027456358,0.0009716609,0.00001998022],"about_ca_topic_score_codex":0.0006943184,"about_ca_topic_score_gemma":0.0006699676,"teacher_disagreement_score":0.0042330883,"about_ca_system_score_codex":0.0013358785,"about_ca_system_score_gemma":0.0013711283,"threshold_uncertainty_score":0.022387028},"labels":[],"label_agreement":null},{"id":"W2081574256","doi":"10.1109/jsac.2012.121026","title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-Channel Multi-User Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Ontario Tech University; University of Toronto","funders":"","keywords":"Computer science; Relay; Channel (broadcasting); Mathematical optimization; Optimization problem; Computational complexity theory; Transmission (telecommunications); Integer programming; Hop (telecommunications); Channel allocation schemes; Dual (grammatical number); Computer network; Power (physics); Wireless; Algorithm; Telecommunications; Mathematics","score_opus":0.100493455129988,"score_gpt":0.3370818190684847,"score_spread":0.23658836393849672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081574256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06842833,0.0003719704,0.9270272,0.00028163672,0.000026350115,0.00006462206,0.00008078151,0.000151692,0.003567434],"genre_scores_gemma":[0.8664631,0.0002888634,0.13097839,0.000060315586,0.00002623519,0.00013936215,0.00008035068,0.0000549603,0.0019084269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908364,0.0004890043,0.000029359499,0.00010736371,0.00015509196,0.00013545419],"domain_scores_gemma":[0.99871135,0.0009090667,0.0001249617,0.00008753518,0.00010834974,0.000058715566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017399034,0.0010455815,0.0012744822,0.0005838809,0.00043392074,0.0012480565,0.00074955425,0.0011814013,0.0013606838],"category_scores_gemma":[0.0040947595,0.00067499804,0.0005450914,0.00086006476,0.0009316151,0.0013238871,0.0011938222,0.000812211,0.00032465925],"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.000047211593,0.000032911605,0.00016542707,0.00003137406,0.00001362304,0.000054663924,0.000034237903,0.9830617,0.00082947203,0.0075603775,0.00029715258,0.007871753],"study_design_scores_gemma":[0.000011171713,0.000018371411,0.000026612275,0.000001749174,0.000004073577,0.000009821849,0.000009773765,0.9948538,0.00024766923,0.004706967,0.0001066202,0.0000034078691],"about_ca_topic_score_codex":0.0020768247,"about_ca_topic_score_gemma":0.0021999895,"teacher_disagreement_score":0.0020768247,"about_ca_system_score_codex":0.0009850763,"about_ca_system_score_gemma":0.0011842895,"threshold_uncertainty_score":0.009201586},"labels":[],"label_agreement":null},{"id":"W2082715560","doi":"10.1109/jsac.2012.120512","title":"Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":67,"is_retracted":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; Computer network; Bottleneck; Scheduling (production processes); Quality of service; Distributed computing; Provisioning; Schedule; Resource allocation; Mathematical optimization","score_opus":0.038591125500475824,"score_gpt":0.2617042065967713,"score_spread":0.22311308109629546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082715560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36861148,0.00036259773,0.6260282,0.0001628927,0.000035112134,0.00009252439,0.00009421125,0.0003757684,0.0042372914],"genre_scores_gemma":[0.9647077,0.0001600146,0.033559814,0.00002873548,0.000017627637,0.000028492721,0.0000840097,0.000029968409,0.0013835721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00008791452,0.000012117488,0.000057434314,0.00008906976,0.000099405624],"domain_scores_gemma":[0.9994779,0.0002493784,0.000089363566,0.000046704597,0.000089155605,0.000047554688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035396614,0.0006128217,0.0006308567,0.00030004597,0.00051834545,0.00075063045,0.00086090155,0.00060544006,0.0011502343],"category_scores_gemma":[0.0010608854,0.0002428401,0.00030777065,0.0008094712,0.0004157981,0.0008604045,0.0005793132,0.00043342815,0.00017747554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020116141,0.00012559617,0.001337568,0.00008161724,0.000028287004,0.00013734079,0.0000762845,0.93642044,0.009750519,0.0033774136,0.0007382474,0.047725495],"study_design_scores_gemma":[0.0000062127237,0.00004042213,0.0002572907,0.0000013192982,0.0000058773057,0.000018258035,0.000026730675,0.99704474,0.0018251594,0.0005419653,0.00022951812,0.0000024329538],"about_ca_topic_score_codex":0.008073593,"about_ca_topic_score_gemma":0.0062543005,"teacher_disagreement_score":0.008073593,"about_ca_system_score_codex":0.0011560043,"about_ca_system_score_gemma":0.0007802344,"threshold_uncertainty_score":0.0160532},"labels":[],"label_agreement":null},{"id":"W2082884797","doi":"10.1109/jsac.2011.110801","title":"Guest Editorial Advances in Digital Forensics for Communications and Networking","year":2011,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Digital and Cyber Forensics","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 Ottawa","funders":"","keywords":"Network forensics; Digital forensics; Computer science; Computer forensics; Focus (optics); Computer security; Digital evidence; World Wide Web; Telecommunications; Internet privacy","score_opus":0.023795839495848417,"score_gpt":0.2871430264179288,"score_spread":0.2633471869220804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082884797","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058652015,0.0040724436,0.0002307183,0.014933688,0.9782216,0.000018719102,0.000039102462,0.00005040435,0.0023747396],"genre_scores_gemma":[0.0005202792,0.005544101,0.00014362889,0.005568699,0.97236294,0.000016925387,0.000036674035,0.00003790212,0.01576896],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972844,0.00027899194,0.00029939206,0.00032791437,0.0015669394,0.00024242571],"domain_scores_gemma":[0.9861227,0.0033835033,0.0008143359,0.00034798356,0.007410842,0.0019207096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037478697,0.002601111,0.0020639717,0.0034228228,0.0020006427,0.006231049,0.0018084765,0.006678402,0.018734425],"category_scores_gemma":[0.011158089,0.0007019218,0.0015656562,0.001194829,0.0012223899,0.0032024817,0.0012757223,0.01032348,0.014146267],"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.000050514598,0.000016753698,0.000029147664,0.0002327906,0.000011890273,0.00015644866,0.0000109176335,0.000035084504,0.00019042678,0.0005046703,0.9869006,0.01186067],"study_design_scores_gemma":[0.000025077612,0.000034455814,0.00017203378,0.00023027493,0.000026003703,0.00035232079,0.0000271748,0.00011806233,0.00026181835,0.0007649921,0.99797493,0.000012872839],"about_ca_topic_score_codex":0.00037342042,"about_ca_topic_score_gemma":0.001031563,"teacher_disagreement_score":0.018734425,"about_ca_system_score_codex":0.001375851,"about_ca_system_score_gemma":0.0013924403,"threshold_uncertainty_score":0.06267291},"labels":[],"label_agreement":null},{"id":"W2084014922","doi":"10.1109/jsac.2011.110106","title":"Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":160,"is_retracted":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; Partition (number theory); Computer network; Scheme (mathematics); Vehicular ad hoc network; Stochastic game; Nash equilibrium; Game theory; Wireless ad hoc network; Telecommunications; Wireless; Mathematical optimization","score_opus":0.04781995912228642,"score_gpt":0.2559237373815255,"score_spread":0.2081037782592391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084014922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058775637,0.0004237635,0.92669713,0.0006370611,0.00008088771,0.00023251634,0.00015658628,0.00012092011,0.012875568],"genre_scores_gemma":[0.9029196,0.00055080676,0.085990176,0.00018408596,0.000056162113,0.0006903076,0.0002298388,0.00006278591,0.009316203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983198,0.00096946064,0.000064169435,0.0001959875,0.00022914482,0.00022146618],"domain_scores_gemma":[0.9967963,0.0021958228,0.0003315516,0.00012874919,0.00025201787,0.0002956233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426552,0.0012450092,0.0014203253,0.0006412073,0.0009385706,0.0014374207,0.002011482,0.0013134523,0.0028819551],"category_scores_gemma":[0.0068183313,0.00047361723,0.00087850646,0.0007383624,0.001739616,0.0019012279,0.0021196383,0.0016851976,0.0003844093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015762862,0.000058525344,0.00047418804,0.00008453538,0.00007015999,0.0002256946,0.00035608513,0.79291815,0.00089261535,0.19407971,0.0017298593,0.008952821],"study_design_scores_gemma":[0.000050836996,0.000039046794,0.00009926649,0.000011904807,0.000010888165,0.0000318787,0.00006212738,0.9247143,0.0001866003,0.073502764,0.0012786504,0.000011640616],"about_ca_topic_score_codex":0.005754504,"about_ca_topic_score_gemma":0.005152855,"teacher_disagreement_score":0.005754504,"about_ca_system_score_codex":0.0026345504,"about_ca_system_score_gemma":0.0018612355,"threshold_uncertainty_score":0.01911515},"labels":[],"label_agreement":null},{"id":"W2084099189","doi":"10.1109/jsac.2014.2328143","title":"Distributed Pricing-Based User Association for Downlink Heterogeneous Cellular Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":246,"is_retracted":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; Coordinate descent; Base station; Beamforming; Telecommunications link; Subgradient method; Transmitter power output; Benchmark (surveying); Mathematical optimization; Optimization problem; Power control; User equipment; Algorithm; Computer network; Power (physics); Transmitter; Mathematics; Telecommunications","score_opus":0.012165979632562506,"score_gpt":0.24118474523042416,"score_spread":0.22901876559786166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084099189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035018813,0.00026392573,0.9621784,0.00016437186,0.00004103747,0.00004208034,0.000016819242,0.00009278538,0.002181708],"genre_scores_gemma":[0.9382623,0.00020021258,0.0592058,0.000060070706,0.00005764534,0.00005302723,0.00003508123,0.00003308633,0.0020928062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984219,0.00076722854,0.000042053303,0.00018126109,0.00037347327,0.00021416394],"domain_scores_gemma":[0.998665,0.0007219978,0.00015269221,0.00013756611,0.00022726762,0.00009542367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018716047,0.0008722188,0.0015804477,0.000357846,0.00064113893,0.0013675835,0.0015767171,0.0010603312,0.0009985741],"category_scores_gemma":[0.004860288,0.00043327676,0.00046556574,0.0011182891,0.0011190787,0.0015183165,0.0012454333,0.001033687,0.00019346332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006591649,0.00006783103,0.0005197322,0.000019953644,0.000021995023,0.00006653403,0.00003006765,0.9601941,0.0012048377,0.013506237,0.0004157354,0.023887116],"study_design_scores_gemma":[0.0000045486795,0.000013395767,0.000040302737,6.419914e-7,0.0000025089212,0.0000075663866,0.0000037739917,0.99798113,0.00017454714,0.0016715068,0.000098111916,0.0000019383003],"about_ca_topic_score_codex":0.004747416,"about_ca_topic_score_gemma":0.0037653635,"teacher_disagreement_score":0.004747416,"about_ca_system_score_codex":0.0015800627,"about_ca_system_score_gemma":0.0013902228,"threshold_uncertainty_score":0.011464179},"labels":[],"label_agreement":null},{"id":"W2087447400","doi":"10.1109/jsac.2013.130801","title":"Guest Editorial: Theories and Methods for Advanced Wireless Relays — Issue II","year":2013,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"Queen's University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Focus (optics); Wireless network; The Internet; Relay; Computer security; Multimedia; World Wide Web","score_opus":0.02470772696548005,"score_gpt":0.37398796460564204,"score_spread":0.349280237640162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087447400","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029038372,0.0038516764,0.00026176317,0.021785293,0.972809,0.000014041476,0.000022634871,0.000033654145,0.0011929104],"genre_scores_gemma":[0.00034475615,0.0035519109,0.00014151691,0.009520026,0.9801854,0.000017452197,0.000017177203,0.000033898432,0.0061878287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617225,0.0005163809,0.00042252144,0.00045332912,0.0021835621,0.00025196173],"domain_scores_gemma":[0.9813069,0.0069378,0.0010281323,0.00047965368,0.008403337,0.0018440987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378386,0.0033203661,0.0026830635,0.0033061253,0.0024809004,0.006530037,0.0030092401,0.011147677,0.011121898],"category_scores_gemma":[0.019369755,0.0009560329,0.0023508405,0.0012139168,0.0028036667,0.0040521147,0.001225923,0.020090654,0.01138434],"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.000035934485,0.000014653457,0.000021680975,0.00014457174,0.000014125311,0.000089319336,0.000009410492,0.00003367662,0.00008819821,0.0007269514,0.99350315,0.0053183986],"study_design_scores_gemma":[0.000060852726,0.000042678752,0.00021510107,0.00034405387,0.000048038306,0.00029075128,0.00003120759,0.00033285434,0.00023905646,0.0021465814,0.996227,0.000021829337],"about_ca_topic_score_codex":0.0006637157,"about_ca_topic_score_gemma":0.0015517022,"teacher_disagreement_score":0.011147677,"about_ca_system_score_codex":0.0022353171,"about_ca_system_score_gemma":0.0020146163,"threshold_uncertainty_score":0.03720647},"labels":[],"label_agreement":null},{"id":"W2087752598","doi":"10.1109/jsac.2014.2330151","title":"Performance of Full-Duplex AF Relaying in the Presence of Residual Self-Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":214,"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; University of Akron","keywords":"Pairwise error probability; Computer science; Diversity gain; Coding gain; Interference (communication); Residual; Topology (electrical circuits); Superposition principle; Bit error rate; Algorithm; Transmission (telecommunications); Control theory (sociology); Mathematics; Telecommunications; Fading; Decoding methods; Channel (broadcasting)","score_opus":0.025993638118406135,"score_gpt":0.2616165675550605,"score_spread":0.2356229294366544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087752598","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.96068496,0.00062280963,0.03441257,0.00009914032,0.000018287681,0.000008836221,0.00007878418,0.00012740048,0.003947121],"genre_scores_gemma":[0.9987417,0.000083612715,0.0008967957,0.000007864847,0.000004145009,0.000002438643,0.000017481507,0.0000031443687,0.00024290547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993457,0.00018057022,0.000033181976,0.000104017214,0.0002151182,0.00012132603],"domain_scores_gemma":[0.9944501,0.0041735712,0.00042769228,0.00030358252,0.00053384097,0.00011129241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093819,0.0004309842,0.00062747236,0.00033903084,0.0003788993,0.00082386564,0.00050786574,0.0008528165,0.0005449059],"category_scores_gemma":[0.005241598,0.00014067328,0.00022247148,0.0003223683,0.0007741824,0.0008029676,0.0005965266,0.0003093433,0.00017558411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019321591,0.0001568808,0.007880292,0.0002670274,0.00015423397,0.0008827815,0.0005981829,0.85306096,0.08464824,0.010326408,0.00045946118,0.03963341],"study_design_scores_gemma":[0.00003565422,0.0007446996,0.0035323894,0.000018759089,0.000059464204,0.0007412482,0.00012384614,0.9694892,0.02216118,0.002770117,0.00028525974,0.00003816394],"about_ca_topic_score_codex":0.0017014756,"about_ca_topic_score_gemma":0.0008811619,"teacher_disagreement_score":0.0017014756,"about_ca_system_score_codex":0.00043214223,"about_ca_system_score_gemma":0.00048372964,"threshold_uncertainty_score":0.00578475},"labels":[],"label_agreement":null},{"id":"W2088397325","doi":"10.1109/jsac.2012.120214","title":"Joint Zero-Forcing Based Precoder Design for QoS-Aware Power Allocation in MIMO Cooperative Cellular Network","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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; Base station; Transmitter power output; MIMO; Computer network; Quality of service; Relay; RSS; Enhanced Data Rates for GSM Evolution; Cellular network; Transmission (telecommunications); Interference (communication); Real-time computing; Power (physics); Channel (broadcasting); Telecommunications; Transmitter","score_opus":0.09895340924816749,"score_gpt":0.3111637100563262,"score_spread":0.21221030080815872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088397325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02381252,0.0001596472,0.97485006,0.00007901745,0.00001749936,0.000023581693,0.00001945925,0.000055502962,0.0009828532],"genre_scores_gemma":[0.88701123,0.00037943036,0.11088752,0.000086479675,0.000046395257,0.00013705397,0.000050320145,0.000015116067,0.0013864835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.00015996161,0.000015765196,0.00006046438,0.00011116372,0.0000521328],"domain_scores_gemma":[0.99930334,0.000410201,0.0000802084,0.000043222004,0.00014326784,0.00001971127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058996293,0.00059053086,0.000520489,0.00018964236,0.00022130074,0.00052285835,0.0005312306,0.000651815,0.00062886224],"category_scores_gemma":[0.001791634,0.00027227736,0.0002530473,0.0003397535,0.0005871374,0.00036843488,0.00044347858,0.00036788982,0.00019607642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008648637,0.000039214614,0.0005921182,0.00009140733,0.00003549377,0.00009572155,0.00012148555,0.94468987,0.014718705,0.008593495,0.00051127916,0.03042473],"study_design_scores_gemma":[0.000011225073,0.00005481759,0.0000882539,0.0000046810874,0.0000074046525,0.000022926659,0.000008691345,0.9969512,0.00124476,0.0014166688,0.0001843234,0.0000050766316],"about_ca_topic_score_codex":0.0018536319,"about_ca_topic_score_gemma":0.0021677848,"teacher_disagreement_score":0.0018536319,"about_ca_system_score_codex":0.00042717595,"about_ca_system_score_gemma":0.0007831275,"threshold_uncertainty_score":0.0036857128},"labels":[],"label_agreement":null},{"id":"W2089048768","doi":"10.1109/49.887912","title":"Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","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":"University of Alberta","funders":"","keywords":"Computer science; Modular design; Modularity (biology); Network topology; Wavelength-division multiplexing; Distributed computing; Graph; Spare part; Network planning and design; Node (physics); Rounding; Mesh networking; Mathematical optimization; Topology (electrical circuits); Theoretical computer science; Computer network; Telecommunications; Mathematics; Operations management","score_opus":0.01336600935626836,"score_gpt":0.24159504326709402,"score_spread":0.22822903391082566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089048768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28795928,0.00050711265,0.6970088,0.0004917024,0.000031186188,0.000048061385,0.000027974695,0.00006581949,0.0138601],"genre_scores_gemma":[0.9369862,0.0003989243,0.06157795,0.00004763595,0.000012983027,0.000026447207,0.0000075109324,0.0000317659,0.0009105072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993998,0.00035670307,0.000013052882,0.000041864696,0.00013867985,0.000049853905],"domain_scores_gemma":[0.9977875,0.0015685388,0.00035851705,0.00011476414,0.00011939718,0.00005127868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019306,0.00047516872,0.00027370965,0.00037676896,0.00022794656,0.0008411891,0.00046088742,0.00037623668,0.000740807],"category_scores_gemma":[0.0052581555,0.00036958486,0.00044732355,0.00029263226,0.00093600416,0.00082638836,0.0006150529,0.00044844105,0.0000782735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043239652,0.000019396,0.0007887333,0.00007086357,0.000018287057,0.00007826875,0.000034247583,0.94717765,0.005891314,0.03354614,0.00008870288,0.0122431],"study_design_scores_gemma":[0.000011335831,0.00010801434,0.0005311706,0.000016395863,0.000020596071,0.00004459864,0.00002862155,0.979943,0.0037109682,0.015054727,0.0005222587,0.000008404062],"about_ca_topic_score_codex":0.00060290896,"about_ca_topic_score_gemma":0.0011624049,"teacher_disagreement_score":0.002019306,"about_ca_system_score_codex":0.00084749184,"about_ca_system_score_gemma":0.0004996803,"threshold_uncertainty_score":0.010679185},"labels":[],"label_agreement":null},{"id":"W2089242380","doi":"10.1109/jsac.2014.2369611","title":"Connectivity of Cognitive Device-to-Device Communications Underlying Cellular Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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":"University of British Columbia","funders":"","keywords":"Computer science; Underlay; Cellular network; Computer network; Base station; Interference (communication); Spectral efficiency; Wireless; Stochastic geometry; Distributed computing; Telecommunications; Signal-to-noise ratio (imaging); Channel (broadcasting); Mathematics","score_opus":0.04957185230626924,"score_gpt":0.30811931139440424,"score_spread":0.258547459088135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089242380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13680366,0.004544282,0.80882835,0.00092690485,0.00010537827,0.00009775862,0.00031657904,0.0002983348,0.048078775],"genre_scores_gemma":[0.98471016,0.0017744382,0.011676141,0.00008086588,0.00006200345,0.000070368405,0.000060967064,0.000016719,0.0015483354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996008,0.0001216613,0.000013079759,0.000076655044,0.0001211217,0.00006673301],"domain_scores_gemma":[0.99897987,0.00065934047,0.00010695249,0.0000806075,0.00013594404,0.00003721529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035182727,0.0004803217,0.00032176307,0.00066476845,0.0005703434,0.0013393181,0.00080605445,0.00066779484,0.0014597748],"category_scores_gemma":[0.0033223585,0.00025876568,0.00026668631,0.0007253008,0.00091440236,0.0011719794,0.0009935052,0.0005512481,0.00017876051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065599816,0.00002881591,0.0027465813,0.0001809872,0.00003898666,0.0004612478,0.00020726728,0.67745084,0.0060430244,0.2827645,0.0015460317,0.028466128],"study_design_scores_gemma":[0.0000047017684,0.000028498838,0.0009734878,0.00002561665,0.000015570184,0.00018630335,0.0000626389,0.9220444,0.0006643995,0.073286384,0.0026960913,0.000011905602],"about_ca_topic_score_codex":0.0031624413,"about_ca_topic_score_gemma":0.0022417533,"teacher_disagreement_score":0.0031624413,"about_ca_system_score_codex":0.0010481018,"about_ca_system_score_gemma":0.0005611703,"threshold_uncertainty_score":0.0076045394},"labels":[],"label_agreement":null},{"id":"W2090709584","doi":"10.1109/jsac.2012.120222","title":"A Distributed Multi-Service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":135,"is_retracted":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; Multihoming; Base station; Computer network; Wireless network; Resource allocation; Radio resource management; Wireless; Algorithm; Bandwidth (computing); Heterogeneous network; Distributed computing; Telecommunications; The Internet","score_opus":0.08049653532620309,"score_gpt":0.358224660653129,"score_spread":0.2777281253269259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090709584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008597842,0.00020582977,0.99013406,0.00007755272,0.000040080333,0.000028158676,0.0000066361026,0.00012804318,0.0007818241],"genre_scores_gemma":[0.4970088,0.00024587705,0.49970883,0.00013174991,0.00007127997,0.0002062992,0.00006569143,0.000061335224,0.0025002256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00020887407,0.000029961018,0.00012210818,0.0001550309,0.000090593494],"domain_scores_gemma":[0.9992798,0.00040603773,0.000056759083,0.000044766988,0.00016213629,0.00005058923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014392465,0.00064164354,0.001040881,0.0005811476,0.00080586976,0.00090096926,0.001458991,0.0010695588,0.001426368],"category_scores_gemma":[0.0021257882,0.00034763402,0.00044657604,0.00082813005,0.0006485364,0.001319355,0.0009571976,0.00082476693,0.00033381776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021419175,0.000099131736,0.0005204311,0.00007676637,0.000056029734,0.00011317357,0.00009694078,0.8395442,0.0038331796,0.020296564,0.0015141193,0.13363531],"study_design_scores_gemma":[0.00001540045,0.000016663726,0.000026175172,0.0000017877114,0.000003453158,0.000015594029,0.00000559858,0.99737996,0.0002323848,0.002039742,0.00026054296,0.0000026509454],"about_ca_topic_score_codex":0.002503138,"about_ca_topic_score_gemma":0.0017905768,"teacher_disagreement_score":0.002503138,"about_ca_system_score_codex":0.0010091153,"about_ca_system_score_gemma":0.0010559356,"threshold_uncertainty_score":0.007611513},"labels":[],"label_agreement":null},{"id":"W2091123125","doi":"10.1109/jsac.2014.2332011","title":"Guest Editorial for the Special Series on Smart Grid Communications","year":2014,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Smart Grid Energy Management","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":"Toronto Metropolitan University","funders":"","keywords":"Smart grid; Computer science; Special section; Demand response; Grid; Telecommunications; Energy management; Load management; Range (aeronautics); Distributed computing; Computer security; Electrical engineering; Electricity; Energy (signal processing); Engineering","score_opus":0.018704461401902,"score_gpt":0.2691460952647464,"score_spread":0.2504416338628444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091123125","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035213325,0.0022032405,0.00013367593,0.015762175,0.9794335,0.00001539827,0.00003501872,0.000040855884,0.0023409007],"genre_scores_gemma":[0.00039406578,0.002916457,0.0000976599,0.008298895,0.97309804,0.000015512074,0.00003787962,0.00003735407,0.015104168],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974528,0.00027908853,0.00026218194,0.00040634806,0.0013487499,0.00025084277],"domain_scores_gemma":[0.9905812,0.0017734481,0.0006445087,0.00027044522,0.004720093,0.0020103448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027632918,0.003179251,0.002438147,0.0028216548,0.002205069,0.0061850827,0.0020535588,0.0076619107,0.023068462],"category_scores_gemma":[0.009848554,0.00080424035,0.0020196154,0.0012402631,0.0012626005,0.0031307004,0.001201794,0.013593649,0.019751221],"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.00002447638,0.000014061717,0.000028766635,0.00008083282,0.000007652072,0.000099259414,0.0000046551622,0.000033696004,0.00007372079,0.00027210818,0.9937774,0.005583481],"study_design_scores_gemma":[0.000034514316,0.00004157575,0.00029670392,0.00018281366,0.000024821069,0.00029637472,0.00002467201,0.00018697932,0.00015660656,0.0008828783,0.9978568,0.00001540151],"about_ca_topic_score_codex":0.0008305392,"about_ca_topic_score_gemma":0.0025043183,"teacher_disagreement_score":0.023068462,"about_ca_system_score_codex":0.001873273,"about_ca_system_score_gemma":0.0019491824,"threshold_uncertainty_score":0.07717168},"labels":[],"label_agreement":null},{"id":"W2091387011","doi":"10.1109/jsac.2014.2367751","title":"Guest Editorial Series on Molecular, Biological, and Multiscale Communication (First Issue)","year":2014,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"","keywords":"Computer science; Series (stratigraphy); Molecular communication; Data science; Telecommunications; Biology","score_opus":0.011433841721686525,"score_gpt":0.25606472038239614,"score_spread":0.24463087866070962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091387011","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003596419,0.001714981,0.00012526367,0.009545225,0.98631835,0.000017715054,0.00004725857,0.0000448124,0.002150424],"genre_scores_gemma":[0.0003935361,0.0025626596,0.000115527284,0.0063011274,0.97282356,0.000022893988,0.00004820277,0.000045195335,0.017687261],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972709,0.00025969438,0.00024967064,0.00034074014,0.0016388681,0.00024014211],"domain_scores_gemma":[0.98953724,0.002126479,0.00079953554,0.00025234037,0.0051050386,0.0021793393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037726704,0.0030446867,0.0024398016,0.0027570927,0.0023131906,0.006139878,0.0022045444,0.0062123835,0.03485794],"category_scores_gemma":[0.010675915,0.00082145754,0.0016762441,0.0010470842,0.0011076054,0.0027734782,0.0012656455,0.010356978,0.022628346],"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.00004809525,0.000013653446,0.00002319289,0.00012725143,0.000008864603,0.000077219076,0.0000043138193,0.000023545368,0.00013039752,0.00028216757,0.9934569,0.005804403],"study_design_scores_gemma":[0.000052796608,0.00004371661,0.00025032053,0.00017252551,0.000027826925,0.00019576792,0.000020290367,0.00016247541,0.00028200154,0.00070303964,0.9980757,0.000013428339],"about_ca_topic_score_codex":0.00066280103,"about_ca_topic_score_gemma":0.002443073,"teacher_disagreement_score":0.03485794,"about_ca_system_score_codex":0.0018218055,"about_ca_system_score_gemma":0.002169762,"threshold_uncertainty_score":0.11661136},"labels":[],"label_agreement":null},{"id":"W2095010751","doi":"10.1109/jsac.2012.121011","title":"Distributed Opportunistic Channel Access in Wireless Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Computer science; Relay; Optimal stopping; Computer network; Channel (broadcasting); Throughput; Wireless network; Wireless; Transmission (telecommunications); Stopping time; Channel state information; Mathematical optimization; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.1038579147569856,"score_gpt":0.3465843828383741,"score_spread":0.24272646808138854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095010751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029537532,0.0022274947,0.9613418,0.0003487827,0.00008619687,0.00006503286,0.000045312016,0.0001302695,0.0062176087],"genre_scores_gemma":[0.9591496,0.0014400178,0.03636198,0.000095633986,0.00009971426,0.00012332693,0.00003920038,0.000022618953,0.0026680545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977998,0.0010958868,0.00008042019,0.0003056317,0.00044623064,0.0002719348],"domain_scores_gemma":[0.99519277,0.0035844294,0.0004931484,0.00023887276,0.00036734284,0.00012347479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020211039,0.0007133734,0.00097624806,0.00064464397,0.00068322656,0.001547606,0.0012320282,0.0012085118,0.00070991594],"category_scores_gemma":[0.0057917535,0.00044227034,0.00046739285,0.0010491022,0.0015140185,0.001646712,0.0010649378,0.00070472463,0.00012943789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013860562,0.000056553246,0.0014846273,0.0002656822,0.0001179323,0.000745214,0.00028274657,0.7148661,0.0035684393,0.2400964,0.0016164588,0.03676119],"study_design_scores_gemma":[0.000022208644,0.00005375356,0.00018482344,0.000012479789,0.000017424618,0.00015806977,0.000045427467,0.9405353,0.00043389396,0.0570772,0.0014447218,0.000014711392],"about_ca_topic_score_codex":0.0016981774,"about_ca_topic_score_gemma":0.0013376838,"teacher_disagreement_score":0.0020211039,"about_ca_system_score_codex":0.0012673656,"about_ca_system_score_gemma":0.0010535261,"threshold_uncertainty_score":0.010688722},"labels":[],"label_agreement":null},{"id":"W2096079521","doi":"10.1109/jsac.2007.071202","title":"Characterizing Peer-to-Peer Streaming Flows","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","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":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Peer-to-peer; Computer network; Server; Upload; World Wide Web","score_opus":0.037605225110638824,"score_gpt":0.31407590511332834,"score_spread":0.2764706800026895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096079521","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.94794416,0.00019020226,0.049347423,0.00011077261,0.0000114330505,0.0001111627,0.0007722751,0.00024920463,0.0012634613],"genre_scores_gemma":[0.9878654,0.00012080063,0.01101622,0.000011288022,0.000012277513,0.000052113464,0.00070118374,0.00001930237,0.00020150546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99942493,0.000120064404,0.000034611803,0.00014841055,0.00020246122,0.000069582835],"domain_scores_gemma":[0.9968606,0.0016752427,0.0004967399,0.00027990455,0.0005616206,0.00012586555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589054,0.0003770309,0.0004042115,0.0019458742,0.00049114216,0.000794015,0.00077444944,0.0006797182,0.0003080554],"category_scores_gemma":[0.00897286,0.00020413306,0.00019380139,0.0015059005,0.0005246416,0.0010320143,0.0005180099,0.0004970725,0.00011319432],"study_design_candidate":"observational","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.00022696386,0.0003829438,0.230396,0.00021433715,0.00015538893,0.000989689,0.0017269036,0.6364082,0.041043334,0.014118803,0.001729262,0.07260814],"study_design_scores_gemma":[0.000008576186,0.00004412788,0.03486384,0.000011681578,0.000012496127,0.00021469868,0.0003656584,0.95450413,0.00336442,0.0054827873,0.0011065404,0.000021025939],"about_ca_topic_score_codex":0.0065678884,"about_ca_topic_score_gemma":0.0033942647,"teacher_disagreement_score":0.0065678884,"about_ca_system_score_codex":0.0005743196,"about_ca_system_score_gemma":0.00046363703,"threshold_uncertainty_score":0.013059318},"labels":[],"label_agreement":null},{"id":"W2097915928","doi":"10.1109/jsac.2007.070911","title":"Tomlinson-Harashima Precoding for Broadcast Channels with Uncertainty","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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":"McMaster University","funders":"","keywords":"Precoding; Telecommunications link; Computer science; Channel state information; Channel (broadcasting); Transmitter; Mathematical optimization; MIMO; Control theory (sociology); Constraint (computer-aided design); Robustness (evolution); Convex optimization; Wireless; Mathematics; Telecommunications; Regular polygon","score_opus":0.029403754219449515,"score_gpt":0.292263319400884,"score_spread":0.2628595651814345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097915928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526823,0.00017401823,0.9860363,0.0000774173,0.0000139440135,0.000011966014,0.000025355834,0.0000465035,0.0010876748],"genre_scores_gemma":[0.7290256,0.00060512585,0.26722768,0.00013414508,0.000079564794,0.00013153443,0.00011849286,0.000033744,0.00264413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.00023756878,0.000028022985,0.00012695226,0.0002215354,0.000072876974],"domain_scores_gemma":[0.9988133,0.00074788847,0.00016747195,0.000120100594,0.00012798817,0.000023242896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489517,0.00064389757,0.0007402961,0.00029667126,0.00030261226,0.0006196783,0.0005926289,0.00064964866,0.0007842365],"category_scores_gemma":[0.004569403,0.0003098622,0.000382606,0.0006411707,0.0007558452,0.0008653508,0.0006978894,0.0006101447,0.00018201552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015508154,0.00002384532,0.00052776095,0.00014915013,0.000050449256,0.00011739204,0.0001739279,0.857559,0.011394457,0.07317281,0.00077393756,0.055902235],"study_design_scores_gemma":[0.000016199776,0.00006686301,0.000114313596,0.000010376086,0.00001357622,0.0000408474,0.000020170544,0.97772115,0.0031712118,0.017841242,0.00097336137,0.000010573564],"about_ca_topic_score_codex":0.0017670508,"about_ca_topic_score_gemma":0.0021696752,"teacher_disagreement_score":0.0017670508,"about_ca_system_score_codex":0.0006840204,"about_ca_system_score_gemma":0.0008485917,"threshold_uncertainty_score":0.005018592},"labels":[],"label_agreement":null},{"id":"W2098143839","doi":"10.1109/jsac.2002.1003046","title":"Availability analysis of span-restorable mesh networks","year":2002,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","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 Alberta","funders":"","keywords":"Computer science; Spare part; Process (computing); Mesh networking; Distributed computing; Modular design; Reliability engineering; Dual (grammatical number); Computer network; Telecommunications; Operations management","score_opus":0.03326561017618952,"score_gpt":0.2672701624712476,"score_spread":0.23400455229505807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098143839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39972776,0.0012336395,0.58413315,0.000616786,0.000046509715,0.00006759532,0.00042654102,0.00032670898,0.013421336],"genre_scores_gemma":[0.9923498,0.0002660994,0.006235314,0.000024146242,0.00002187848,0.000023437671,0.000073829535,0.000018752802,0.0009867408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996915,0.00008474986,0.000011772823,0.00004981028,0.000092832095,0.0000693563],"domain_scores_gemma":[0.99845874,0.0010062905,0.00023482056,0.00005503006,0.00018620354,0.000058975835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297873,0.00036284683,0.00033176504,0.00097078545,0.00032335357,0.00039716423,0.00067510287,0.00042429997,0.0017269013],"category_scores_gemma":[0.003209644,0.00018272849,0.00038642978,0.00045610193,0.000579712,0.0008026023,0.0005816444,0.00041149804,0.00012635223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058871283,0.000011013019,0.0011956225,0.000041418753,0.0000136393455,0.000083895895,0.00003753839,0.9795563,0.0024499265,0.011801496,0.00025279247,0.0044973916],"study_design_scores_gemma":[9.274257e-7,0.000013153756,0.00033667852,0.0000024678104,0.0000020882208,0.00001901843,0.00001367336,0.995333,0.0001893127,0.003987105,0.000100601916,0.000001949475],"about_ca_topic_score_codex":0.0035388933,"about_ca_topic_score_gemma":0.0014094153,"teacher_disagreement_score":0.0035388933,"about_ca_system_score_codex":0.0009586366,"about_ca_system_score_gemma":0.0003353025,"threshold_uncertainty_score":0.0070366263},"labels":[],"label_agreement":null},{"id":"W2098277401","doi":"10.1109/jsac.2003.810337","title":"Serially concatenated space-time codes with iterative decoding and performance limits of block-fading channels","year":2003,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"McGill University","funders":"","keywords":"Fading; Computer science; Algorithm; Block code; Decoding methods; Rayleigh fading; Concatenated error correction code; Channel (broadcasting); Bit error rate; Code rate; Convolutional code; Telecommunications; Topology (electrical circuits); Mathematics","score_opus":0.022078619554639144,"score_gpt":0.2636139638415099,"score_spread":0.2415353442868708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098277401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4580776,0.002360454,0.5240249,0.0003468546,0.00005487607,0.00006154392,0.00012663714,0.0005178978,0.014429328],"genre_scores_gemma":[0.9770916,0.00076364033,0.020575155,0.00003141366,0.000025448657,0.000048838196,0.00006240481,0.00004194578,0.0013596261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814296,0.00069532066,0.00006471235,0.00011280406,0.00071204465,0.00027222166],"domain_scores_gemma":[0.99066037,0.0066644168,0.000938207,0.00054590806,0.0010448395,0.00014633176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017822956,0.0007691592,0.00079746527,0.00060797133,0.0005518316,0.0012518627,0.0006712327,0.000981279,0.00090828154],"category_scores_gemma":[0.012251439,0.0003857099,0.000347173,0.0010315867,0.0017631685,0.0019004189,0.0012146074,0.0008396615,0.00028100127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017164896,0.000023987986,0.0011365333,0.0000883553,0.0000400075,0.00021555551,0.0002864596,0.9162544,0.006234404,0.061999407,0.00024616744,0.013303073],"study_design_scores_gemma":[0.000006937746,0.00008187556,0.00025249433,0.000020613441,0.000015929958,0.00010910782,0.000028279304,0.97887814,0.0057881447,0.014375984,0.0004256251,0.000016896265],"about_ca_topic_score_codex":0.0031536177,"about_ca_topic_score_gemma":0.0019077583,"teacher_disagreement_score":0.0031536177,"about_ca_system_score_codex":0.0014142455,"about_ca_system_score_gemma":0.0010473975,"threshold_uncertainty_score":0.010261059},"labels":[],"label_agreement":null},{"id":"W2098857789","doi":"10.1109/jsac.2012.120920","title":"Fair Scheduling and Resource Allocation for Wireless Cellular Network with Shared Relays","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 Toronto","funders":"","keywords":"Computer science; Relay; Computer network; Frequency reuse; Scheduling (production processes); Beamforming; Wireless; Base station; Wireless network; Resource allocation; Backhaul (telecommunications); Distributed computing; Telecommunications; Mathematical optimization","score_opus":0.049001630630752684,"score_gpt":0.28698898809993334,"score_spread":0.23798735746918065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098857789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06739419,0.0007305346,0.92700446,0.00024376536,0.00010751489,0.00011373069,0.00008491432,0.00019502494,0.004125824],"genre_scores_gemma":[0.9493436,0.00026573375,0.048778176,0.00004657578,0.000059571164,0.00009805948,0.00003375755,0.00002467707,0.0013498819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00046019984,0.000035905345,0.00017245929,0.00022885152,0.00021514628],"domain_scores_gemma":[0.99814,0.001132947,0.00017024946,0.00019186859,0.00023854282,0.00012629863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298956,0.00076436193,0.0008979843,0.00054615544,0.0010070849,0.0011737468,0.0013698693,0.0006766575,0.0014502765],"category_scores_gemma":[0.004975799,0.00031619234,0.00031951233,0.0008049449,0.0011259854,0.0013107898,0.0010132312,0.00054756436,0.00023115159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001904415,0.000049249702,0.00032155906,0.000047630765,0.000030861203,0.00009252549,0.000080309386,0.92892605,0.002132388,0.041867416,0.0012350235,0.0250266],"study_design_scores_gemma":[0.000014821227,0.000023058072,0.000059090336,0.000002357796,0.0000059469307,0.000013110233,0.000014555559,0.9879892,0.0003231737,0.011154086,0.00039552967,0.000005017694],"about_ca_topic_score_codex":0.0059047174,"about_ca_topic_score_gemma":0.0074864635,"teacher_disagreement_score":0.0059047174,"about_ca_system_score_codex":0.0025227906,"about_ca_system_score_gemma":0.0023217725,"threshold_uncertainty_score":0.018304229},"labels":[],"label_agreement":null},{"id":"W2099546942","doi":"10.1109/jsac.2010.100602","title":"Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"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":"Computer science; Computer network; Quality of service; Token bucket; Voice over IP; The Internet; Jitter; Backbone network; Backup; Provisioning; Queueing theory; Distributed computing; Telecommunications; Operating system","score_opus":0.01582757175042726,"score_gpt":0.27776643564655895,"score_spread":0.2619388638961317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099546942","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.5581569,0.00040862485,0.4352353,0.00034710907,0.00004373859,0.00010797277,0.00006680161,0.00070927513,0.00492423],"genre_scores_gemma":[0.98029894,0.00012535963,0.019130437,0.00002637457,0.0000076114234,0.000017604087,0.00003726526,0.0000171052,0.00033931245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996916,0.000060159335,0.000013292202,0.000039013295,0.00010223371,0.00009367054],"domain_scores_gemma":[0.99935967,0.00026625654,0.0001000625,0.000068979774,0.00015521738,0.000049812366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053848576,0.00041843115,0.00030564572,0.00039897856,0.0005724917,0.0007523492,0.0005363973,0.00041637025,0.00080414995],"category_scores_gemma":[0.002078349,0.00018283671,0.00014622869,0.0004237979,0.0005764263,0.000846813,0.00047211556,0.0004050317,0.00010752301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015515937,0.000055134115,0.0013090582,0.000049702092,0.000017904224,0.00009844563,0.00008127897,0.94385505,0.015508706,0.009064931,0.0007050258,0.029099658],"study_design_scores_gemma":[0.000010253764,0.00003799667,0.00020466794,0.0000024874603,0.0000042557845,0.000021459093,0.000028895343,0.9953473,0.001957741,0.0020317507,0.00034909477,0.0000042101597],"about_ca_topic_score_codex":0.005063687,"about_ca_topic_score_gemma":0.004196274,"teacher_disagreement_score":0.005063687,"about_ca_system_score_codex":0.0010908465,"about_ca_system_score_gemma":0.001107292,"threshold_uncertainty_score":0.010068417},"labels":[],"label_agreement":null},{"id":"W2099726047","doi":"10.1109/jsac.2011.110413","title":"QoS Provisioning for Heterogeneous Services in Cooperative Cognitive Radio Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":108,"is_retracted":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; Cognitive radio; Computer network; Provisioning; Resource allocation; Blocking (statistics); Frequency allocation; Channel (broadcasting); Admission control; Channel allocation schemes; Resource management (computing); Call Admission Control; Distributed computing; Wireless; Wireless network; Telecommunications","score_opus":0.03840817487842613,"score_gpt":0.28467733807495343,"score_spread":0.2462691631965273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099726047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06706898,0.0016116254,0.92628187,0.00044092382,0.00012821035,0.000045604986,0.000019852447,0.000211086,0.0041918233],"genre_scores_gemma":[0.9500317,0.00046861742,0.048215374,0.00010700414,0.000117484204,0.000058829806,0.000020420968,0.000020939158,0.0009596955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989942,0.00031944097,0.000036464102,0.0001258689,0.00035534118,0.00016874471],"domain_scores_gemma":[0.99892056,0.0005066916,0.00012708687,0.00012954237,0.00021309732,0.00010306924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017415315,0.0006655469,0.0006180203,0.0004259282,0.0008563934,0.0014581195,0.0015474182,0.0008225964,0.00051855645],"category_scores_gemma":[0.0028307808,0.00023336048,0.00040001175,0.00048370077,0.00076139905,0.0013441611,0.0014475818,0.00078283314,0.00015311441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017247853,0.0001735901,0.0015882734,0.00018521478,0.000101089696,0.0008910341,0.00060314016,0.73805994,0.02119861,0.11698789,0.0021596726,0.117878996],"study_design_scores_gemma":[0.000008726329,0.000027984663,0.00013046779,0.000005707469,0.00001638415,0.00007381906,0.00005775747,0.98266774,0.0008304331,0.01486713,0.0013032069,0.000010668826],"about_ca_topic_score_codex":0.0024786005,"about_ca_topic_score_gemma":0.002480715,"teacher_disagreement_score":0.0024786005,"about_ca_system_score_codex":0.00075191515,"about_ca_system_score_gemma":0.0009441665,"threshold_uncertainty_score":0.009210169},"labels":[],"label_agreement":null},{"id":"W2100074754","doi":"10.1109/jsac.2005.863862","title":"Optimal ACK mechanisms of the IEEE 802.15.3 MAC for ultra-wideband systems","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Throughput; Channel (broadcasting); Network allocation vector; Wireless; Transmission (telecommunications); Control channel; Wireless network; IEEE 802.11; Telecommunications; Base station","score_opus":0.028964369912634767,"score_gpt":0.28434984730905943,"score_spread":0.25538547739642464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100074754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04193575,0.003135887,0.948441,0.0004687202,0.00030062124,0.00020258794,0.00006841639,0.0007278307,0.004719101],"genre_scores_gemma":[0.8540901,0.001950651,0.14195946,0.00022006848,0.000169518,0.00028910866,0.000062016006,0.00007123188,0.0011878312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797934,0.0007481575,0.0001729627,0.00019767055,0.0006012704,0.0003006603],"domain_scores_gemma":[0.99706393,0.0012986329,0.0005105129,0.00034585455,0.0007113889,0.00006972426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004121774,0.001389233,0.0008615412,0.0009007324,0.0009341345,0.0016643235,0.0015334637,0.0008998639,0.0014116243],"category_scores_gemma":[0.008358386,0.00049513887,0.0005317894,0.0006233782,0.00079114694,0.0021875633,0.0008342078,0.0013161252,0.00041221475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009848331,0.0005088406,0.0022608994,0.0004272149,0.00014420394,0.0003725343,0.00027042624,0.6610235,0.031663164,0.12903869,0.004697111,0.1686086],"study_design_scores_gemma":[0.00010170829,0.00023077823,0.00064508227,0.000043958098,0.000110065004,0.00013628503,0.000044343826,0.96157473,0.010015155,0.023895936,0.003145912,0.000055960078],"about_ca_topic_score_codex":0.0017216793,"about_ca_topic_score_gemma":0.0017464644,"teacher_disagreement_score":0.004121774,"about_ca_system_score_codex":0.0011378634,"about_ca_system_score_gemma":0.0024031687,"threshold_uncertainty_score":0.021798313},"labels":[],"label_agreement":null},{"id":"W2100909350","doi":"10.1109/jsac.2014.141109","title":"Dynamic Spectrum Access in Multi-Channel Cognitive Radio Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":131,"is_retracted":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":"Cognitive radio; Computer science; Optimization problem; Mathematical optimization; Channel (broadcasting); Convex optimization; Bipartite graph; Channel allocation schemes; Graph; Algorithm; Theoretical computer science; Computer network; Regular polygon; Telecommunications; Wireless; Mathematics","score_opus":0.03634752558972938,"score_gpt":0.3123992826211243,"score_spread":0.27605175703139495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100909350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022841614,0.0016653847,0.9701056,0.00027871242,0.00011467977,0.000042267588,0.000034498524,0.00010385849,0.0048133973],"genre_scores_gemma":[0.9504958,0.0017298153,0.044595063,0.00017720462,0.00014710645,0.00014640666,0.00004665179,0.000024937255,0.0026370422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.00049061223,0.000053366344,0.00035283566,0.00036790027,0.00023240253],"domain_scores_gemma":[0.99900144,0.000599323,0.0001426368,0.00006303915,0.0001343916,0.000059212693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010509783,0.00084710843,0.0008418554,0.00055384845,0.0006094013,0.0013195316,0.0014227695,0.0010884186,0.00082000555],"category_scores_gemma":[0.0023200249,0.00040986837,0.0006736401,0.0010627324,0.0012760734,0.0016223352,0.0012077977,0.0010634075,0.00012617957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075070966,0.00007353083,0.00063245185,0.0001986971,0.00007966016,0.00046813273,0.00013501503,0.8323813,0.003699819,0.13313977,0.0009882023,0.028128318],"study_design_scores_gemma":[0.000010099881,0.00003091625,0.000110026325,0.0000068872378,0.000013839411,0.000058405956,0.000020098965,0.97424316,0.00027370395,0.024358394,0.00086277677,0.000011657932],"about_ca_topic_score_codex":0.004237899,"about_ca_topic_score_gemma":0.0027417345,"teacher_disagreement_score":0.004237899,"about_ca_system_score_codex":0.0013510282,"about_ca_system_score_gemma":0.0011344564,"threshold_uncertainty_score":0.009802461},"labels":[],"label_agreement":null},{"id":"W2102659255","doi":"10.1109/jsac.2008.081009","title":"Distributed beamforming in wireless relay networks with quantized feedback","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":138,"is_retracted":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; Computer science; Beamforming; Upper and lower bounds; Synchronization (alternating current); Asynchronous communication; Bit error rate; Signal-to-noise ratio (imaging); Diversity gain; Wireless; Wireless network; Control theory (sociology); Diversity combining; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Decoding methods; Fading; MIMO; Channel (broadcasting)","score_opus":0.04857823550778225,"score_gpt":0.28659306463539236,"score_spread":0.2380148291276101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102659255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011968587,0.0014659625,0.9844726,0.00015589551,0.00004832938,0.000022201755,0.000022860118,0.000090796304,0.0017527487],"genre_scores_gemma":[0.7767073,0.0074548884,0.21062621,0.0002148678,0.00028297576,0.00020417677,0.00006584326,0.000056183486,0.0043876236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00041135665,0.000035801902,0.00009813721,0.00022412388,0.00005672806],"domain_scores_gemma":[0.99885035,0.0008278587,0.00010032837,0.0000739471,0.00013103781,0.00001653737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923276,0.00082668214,0.00067336473,0.00034983674,0.00028982325,0.0007818271,0.0006230892,0.00064020377,0.0009223225],"category_scores_gemma":[0.002653562,0.00034907885,0.00024333932,0.00086679455,0.001082822,0.0015895814,0.00063668954,0.0005892141,0.0002995315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109907116,0.00004856992,0.00036112606,0.0002635929,0.000031857973,0.00012987254,0.00013722193,0.8105792,0.01660223,0.09263104,0.0012582751,0.07784709],"study_design_scores_gemma":[0.000020272999,0.00014305925,0.00010718373,0.000025545485,0.000013094153,0.00007017399,0.000027201173,0.95972675,0.002556713,0.0358913,0.0013973963,0.000021281856],"about_ca_topic_score_codex":0.000769774,"about_ca_topic_score_gemma":0.000767276,"teacher_disagreement_score":0.0009923276,"about_ca_system_score_codex":0.00065507984,"about_ca_system_score_gemma":0.000366523,"threshold_uncertainty_score":0.00524801},"labels":[],"label_agreement":null},{"id":"W2102859083","doi":"10.1109/jsac.2009.090502","title":"Sage: a strong privacy-preserving scheme against global eavesdropping for ehealth systems","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cryptography and Data Security","field":"Computer Science","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 Waterloo; Ontario Tech University","funders":"","keywords":"Eavesdropping; Computer science; eHealth; Adversary; Scheme (mathematics); Software deployment; Computer security; Information privacy; Cryptography; Internet privacy; Health care","score_opus":0.045704178790714714,"score_gpt":0.33703626263929365,"score_spread":0.29133208384857895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102859083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033214483,0.00071926706,0.9587056,0.0008260716,0.00018482597,0.00021470634,0.00012357306,0.0008753325,0.0051362514],"genre_scores_gemma":[0.8762312,0.00064240186,0.1171818,0.0005299965,0.00018514392,0.00021736784,0.00019391744,0.000044198794,0.004773957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966664,0.001271781,0.0002405428,0.00033313927,0.0011217736,0.00036632776],"domain_scores_gemma":[0.9952485,0.0017632856,0.0006079878,0.0016582869,0.0004705726,0.0002514042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029073223,0.00083235063,0.0010557908,0.0009003815,0.0010198666,0.0013904406,0.001229424,0.0016337935,0.0016036785],"category_scores_gemma":[0.0058555123,0.00031159728,0.0009626357,0.0009458061,0.0021663897,0.0038088427,0.005098089,0.0021591843,0.00070197234],"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.002360116,0.00025671718,0.0022960354,0.0009857849,0.00043824344,0.0018520929,0.0017880535,0.15981907,0.14952168,0.43083695,0.0103336675,0.23951167],"study_design_scores_gemma":[0.00046333318,0.0017847435,0.00128645,0.0001821185,0.00031705614,0.0030866966,0.00046697268,0.64769065,0.11021257,0.18828861,0.04592172,0.0002990946],"about_ca_topic_score_codex":0.00018027828,"about_ca_topic_score_gemma":0.000191264,"teacher_disagreement_score":0.0029073223,"about_ca_system_score_codex":0.0005221594,"about_ca_system_score_gemma":0.0010407561,"threshold_uncertainty_score":0.015375555},"labels":[],"label_agreement":null},{"id":"W2102965185","doi":"10.1109/jsac.2010.101008","title":"Keychain-Based Signatures for Securing BGP","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Internet Traffic Analysis and Secure E-voting","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 Victoria","funders":"","keywords":"Computer science; Hash function; Computer network; Border Gateway Protocol; Software deployment; Overhead (engineering); Merkle tree; Public-key cryptography; Authentication (law); The Internet; Distributed computing; Routing protocol; Computer security; Hash chain; Routing (electronic design automation); Operating system","score_opus":0.02088796696257487,"score_gpt":0.28947777796883767,"score_spread":0.2685898110062628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102965185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15547454,0.0013296027,0.82793975,0.0005779925,0.00022517408,0.00030164773,0.00034163214,0.004431781,0.009377861],"genre_scores_gemma":[0.91344845,0.0004552118,0.083204255,0.00005958053,0.000052068655,0.00009174537,0.00023954528,0.00006231124,0.002386849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855906,0.00039806406,0.0001044648,0.00016653007,0.0005997619,0.00017211348],"domain_scores_gemma":[0.9971967,0.0005634023,0.0003040351,0.0011910792,0.00059793226,0.00014676065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010525946,0.00038777266,0.00045160027,0.0006984929,0.00080521766,0.0009546198,0.0008056636,0.00073016307,0.0020698623],"category_scores_gemma":[0.0032804892,0.0002704748,0.00018944607,0.001118043,0.0006940084,0.0032336263,0.0013762042,0.00091833615,0.00076289964],"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.001496771,0.00038227893,0.0052105687,0.0004753085,0.000070639275,0.0004690279,0.00057790586,0.19038154,0.13390203,0.12816213,0.0087812245,0.5300906],"study_design_scores_gemma":[0.00017103892,0.0004933756,0.00083233905,0.000041446205,0.000041295014,0.00055897044,0.000110903326,0.8460036,0.09124671,0.04251746,0.017893376,0.00008953558],"about_ca_topic_score_codex":0.0012187574,"about_ca_topic_score_gemma":0.0010869183,"teacher_disagreement_score":0.0020698623,"about_ca_system_score_codex":0.0008024926,"about_ca_system_score_gemma":0.0015825959,"threshold_uncertainty_score":0.006924391},"labels":[],"label_agreement":null},{"id":"W2103127461","doi":"10.1109/jsac.2012.121111","title":"Spectrum-Aware Opportunistic Routing in Multi-Hop Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":144,"is_retracted":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; Computer network; Cognitive radio; Geographic routing; Relay; Performance metric; Routing protocol; Exploit; Metrics; Channel (broadcasting); Dynamic Source Routing; Throughput; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Computer security","score_opus":0.06346824116564526,"score_gpt":0.3125873279097428,"score_spread":0.24911908674409755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103127461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055728696,0.0017220217,0.9361476,0.00031285934,0.00015077756,0.00008264214,0.000038099748,0.0002259695,0.005591308],"genre_scores_gemma":[0.9413405,0.0007818732,0.05637288,0.000117999276,0.000075963835,0.00009206732,0.000025840709,0.000029079329,0.0011638034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.00042093307,0.000033277323,0.00011464511,0.00021216083,0.00013964456],"domain_scores_gemma":[0.99830127,0.0011491383,0.00019264901,0.0001415925,0.00014453064,0.000070793256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147928,0.0005654427,0.00066966884,0.0005869458,0.00084895117,0.0010151472,0.0012915849,0.00076586386,0.00041667736],"category_scores_gemma":[0.003071752,0.0004058176,0.00042125268,0.00070109323,0.000845334,0.0013042782,0.00096468034,0.0004829708,0.00007891723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010285414,0.00007420043,0.0009840085,0.00012911137,0.000085623215,0.0004619112,0.00017097726,0.9021134,0.0056764954,0.047138564,0.0010752255,0.041987658],"study_design_scores_gemma":[0.000011356411,0.000039907834,0.00015252538,0.0000068377276,0.000017347866,0.00012457761,0.000033669992,0.9824901,0.00065638305,0.0154699795,0.0009848987,0.000012333994],"about_ca_topic_score_codex":0.0024230187,"about_ca_topic_score_gemma":0.003318664,"teacher_disagreement_score":0.0024230187,"about_ca_system_score_codex":0.0008299806,"about_ca_system_score_gemma":0.0008957565,"threshold_uncertainty_score":0.0069533587},"labels":[],"label_agreement":null},{"id":"W2103134420","doi":"10.1109/jsac.2005.853805","title":"Block-error rate model for DPSK in Rayleigh- and sub-Rayleigh-fading channels","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Western University","funders":"","keywords":"Rayleigh fading; Computer science; Fading; Phase-shift keying; Bit error rate; Algorithm; Markov chain; Channel state information; Transmission (telecommunications); Modulation (music); Block Error Rate; Synchronization (alternating current); Keying; Electronic engineering; Error detection and correction; Rayleigh scattering; Telecommunications; Channel (broadcasting); Wireless; Optics; Physics; Engineering","score_opus":0.04226267067053916,"score_gpt":0.30626092946155004,"score_spread":0.26399825879101085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103134420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04094968,0.0008506742,0.9489791,0.00047647287,0.00008396333,0.00012960754,0.00053007406,0.00039778842,0.007602634],"genre_scores_gemma":[0.93048584,0.001984333,0.048886705,0.00017634779,0.00010990159,0.00054134737,0.00055282743,0.00012829893,0.017134469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891126,0.00028847143,0.00005518158,0.0001572881,0.0004036312,0.00018417767],"domain_scores_gemma":[0.99629503,0.0023904683,0.00046276525,0.00018359932,0.0006096129,0.00005848989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021833032,0.00081390934,0.0013549847,0.00084409444,0.00057146273,0.0011132874,0.0023477853,0.0017929222,0.0034531804],"category_scores_gemma":[0.005767324,0.00047807914,0.0007025057,0.0008742673,0.0012044739,0.0019735666,0.00086385355,0.001567126,0.001164951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056609035,0.000023175144,0.0004608407,0.00006150059,0.00001752327,0.00013600293,0.00010908254,0.9345608,0.0015202037,0.05935764,0.00047714572,0.0032196387],"study_design_scores_gemma":[0.000005334339,0.000011548982,0.000079707665,0.000004679107,0.000005340223,0.000021033013,0.000005227563,0.9959233,0.00017303224,0.0036323424,0.00013179626,0.0000067028564],"about_ca_topic_score_codex":0.010024884,"about_ca_topic_score_gemma":0.0059104976,"teacher_disagreement_score":0.010024884,"about_ca_system_score_codex":0.0016524161,"about_ca_system_score_gemma":0.0011648256,"threshold_uncertainty_score":0.019933045},"labels":[],"label_agreement":null},{"id":"W2103550819","doi":"10.1109/jsac.2009.090605","title":"Optimized multipath network coding in lossy wireless networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":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; Computer network; Unicast; Linear network coding; Retransmission; Network packet; Multicast; Distributed computing; Wireless network; Network congestion; Multiple description coding; Testbed; Wireless; Telecommunications","score_opus":0.04461161403530175,"score_gpt":0.3111233799775617,"score_spread":0.26651176594225995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103550819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06537004,0.0009594949,0.930948,0.00023062571,0.000029336177,0.000026447431,0.00003817823,0.00024304561,0.0021548003],"genre_scores_gemma":[0.8938679,0.0010064181,0.10317498,0.00006426682,0.000048831873,0.00009287762,0.00005284871,0.00004219579,0.0016496374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.00012818143,0.000012032136,0.000043798555,0.00015514305,0.000060274677],"domain_scores_gemma":[0.9986481,0.00081247475,0.00018990375,0.00014347256,0.00017085446,0.000035242752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087854284,0.00035942657,0.0003975336,0.00046698068,0.0003353089,0.0005230742,0.0005918392,0.00036882266,0.00039295474],"category_scores_gemma":[0.0029453656,0.00022771761,0.00016685679,0.00079067063,0.00097301754,0.0011215728,0.00073783274,0.0005594317,0.000080417536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006383206,0.000011940893,0.00031500024,0.00003484029,0.000012915138,0.0000598527,0.00006688433,0.914627,0.005935312,0.048273336,0.0004736809,0.030125374],"study_design_scores_gemma":[0.000008388365,0.000037110698,0.00011761889,0.0000069859993,0.000008293595,0.000044826756,0.000015598007,0.96982557,0.0026550759,0.026210476,0.0010601906,0.00000984195],"about_ca_topic_score_codex":0.0022761011,"about_ca_topic_score_gemma":0.0022923911,"teacher_disagreement_score":0.0022761011,"about_ca_system_score_codex":0.0010419402,"about_ca_system_score_gemma":0.0007800277,"threshold_uncertainty_score":0.0075597763},"labels":[],"label_agreement":null},{"id":"W2104257655","doi":"10.1109/49.983348","title":"On bandwidth-efficient multiuser-space-time signal design and detection","year":2002,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Techniques","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Single antenna interference cancellation; Fading; Multiuser detection; Detector; Minimum mean square error; Bandwidth (computing); Transmission (telecommunications); Base station; Coding gain; Interference (communication); Electronic engineering; Channel (broadcasting); Algorithm; Telecommunications; Decoding methods; Mathematics","score_opus":0.026363392163291994,"score_gpt":0.25216485089662455,"score_spread":0.22580145873333254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104257655","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.00236882,0.0005552769,0.9950789,0.000078867335,0.000024787947,0.000027112148,0.000010582738,0.00007706117,0.0017786077],"genre_scores_gemma":[0.2843167,0.0029856446,0.7059511,0.00028549,0.0002846832,0.00031357366,0.00015021242,0.00007746658,0.0056350664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984981,0.00066344236,0.00005156844,0.0001329026,0.0005705431,0.00008353733],"domain_scores_gemma":[0.9985877,0.0008553359,0.00014277338,0.00018125783,0.00020530977,0.000027591968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014637051,0.0009919155,0.00074743974,0.00064534653,0.00027531167,0.0008119963,0.0008839386,0.0011349779,0.0013331801],"category_scores_gemma":[0.0032339706,0.00036676798,0.00035362228,0.0010185543,0.0009448828,0.001120158,0.0008632019,0.0009069618,0.0010873269],"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.00029864558,0.00016040857,0.00073618296,0.00044053275,0.00010900685,0.00021570805,0.0002458368,0.28354743,0.05775879,0.28698844,0.0040463605,0.36545265],"study_design_scores_gemma":[0.000051401596,0.0003558687,0.00021781553,0.000046082157,0.00002796192,0.00031674115,0.00001870794,0.91261405,0.024813293,0.050575685,0.010923397,0.00003903441],"about_ca_topic_score_codex":0.00031566827,"about_ca_topic_score_gemma":0.00040944997,"teacher_disagreement_score":0.0014637051,"about_ca_system_score_codex":0.0004839796,"about_ca_system_score_gemma":0.0005623826,"threshold_uncertainty_score":0.007740915},"labels":[],"label_agreement":null},{"id":"W2107807801","doi":"10.1109/jsac.2012.121118","title":"Asymptotic Analysis of Interference in Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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 Ottawa","funders":"","keywords":"Cognitive radio; Poisson point process; Computer science; Interference (communication); Poisson distribution; Fading; Exponential distribution; Asymptotic analysis; Cumulant; Point process; Statistical physics; Exponential function; Applied mathematics; Topology (electrical circuits); Mathematics; Algorithm; Statistics; Telecommunications; Physics; Wireless; Decoding methods; Mathematical analysis","score_opus":0.029485585206039982,"score_gpt":0.29335908893535667,"score_spread":0.26387350372931667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107807801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040018223,0.0037230537,0.9289387,0.0007124576,0.00013887844,0.00003667993,0.000106191146,0.00043044635,0.025895419],"genre_scores_gemma":[0.95581937,0.0045624753,0.030972145,0.00038267783,0.0005176511,0.00017497176,0.00020807044,0.0001934374,0.007169157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.0004113284,0.00004755325,0.00012393945,0.00062084245,0.00019866644],"domain_scores_gemma":[0.99202913,0.005817905,0.00068896683,0.0003855076,0.0009215223,0.000157052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414687,0.00097627455,0.00089376065,0.0015353872,0.00048722833,0.0013322269,0.0015916964,0.00094378693,0.00198406],"category_scores_gemma":[0.019456448,0.00043491856,0.0007820301,0.0010976733,0.0020200307,0.001887421,0.0015946947,0.0017984222,0.00045594134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006181092,0.000049029077,0.0018157221,0.0002761004,0.00008995889,0.00036680742,0.00024110367,0.56165826,0.00354629,0.40936998,0.0024277533,0.020097293],"study_design_scores_gemma":[0.0000037651198,0.000020179034,0.00044346697,0.000034324778,0.000012579326,0.00010633792,0.000034692777,0.9190871,0.0004025415,0.07890823,0.00093403907,0.0000126563145],"about_ca_topic_score_codex":0.0029052151,"about_ca_topic_score_gemma":0.001292386,"teacher_disagreement_score":0.0029052151,"about_ca_system_score_codex":0.0018151486,"about_ca_system_score_gemma":0.0011428687,"threshold_uncertainty_score":0.013169944},"labels":[],"label_agreement":null},{"id":"W2109714708","doi":"10.1109/jsac.2007.070219","title":"Joint optimization of relay-precoders and decoders with partial channel side information in cooperative networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":185,"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; Computer science; Channel state information; Beamforming; Relay channel; Decoding methods; Terminal (telecommunication); Channel (broadcasting); Computer network; Transmission (telecommunications); Joint (building); Telecommunications; Wireless; Engineering","score_opus":0.03420949191589935,"score_gpt":0.27794404214119417,"score_spread":0.24373455022529483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109714708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07849862,0.00039907315,0.9184358,0.00016456541,0.000013072805,0.000023968012,0.000051167317,0.0001319622,0.0022818174],"genre_scores_gemma":[0.9172376,0.00040180597,0.07997839,0.000050785067,0.000026215486,0.000092914495,0.000063311985,0.000030032164,0.0021189363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.00065208727,0.00005226007,0.00013837105,0.00019345885,0.00013722826],"domain_scores_gemma":[0.998312,0.0011128421,0.00014125658,0.00017318511,0.0002142431,0.00004653441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020243302,0.0011459946,0.0011276309,0.00035616435,0.0002877248,0.0010560775,0.0006953358,0.001074896,0.00066928385],"category_scores_gemma":[0.0045657605,0.00056426774,0.0003969538,0.0007221671,0.0009330293,0.0011849756,0.0010513654,0.00050868886,0.00030502363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006922474,0.000019000692,0.0003177067,0.00003547844,0.000032847725,0.000059244838,0.00007392642,0.9756615,0.0023190337,0.007763458,0.00021793929,0.013430674],"study_design_scores_gemma":[0.000017604902,0.00005517076,0.0001003132,0.000005514364,0.000018892886,0.000029519095,0.000018502922,0.99028873,0.002048291,0.0072027235,0.00020721943,0.0000075131225],"about_ca_topic_score_codex":0.0018047815,"about_ca_topic_score_gemma":0.001958941,"teacher_disagreement_score":0.0020243302,"about_ca_system_score_codex":0.0005466033,"about_ca_system_score_gemma":0.0011414982,"threshold_uncertainty_score":0.010705829},"labels":[],"label_agreement":null},{"id":"W2109956620","doi":"10.1109/jsac.2008.081023","title":"A design framework for limited feedback MIMO systems with zero-forcing DFE","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Techniques","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":"McMaster University","funders":"","keywords":"Codebook; Transmitter; Computer science; Rayleigh fading; MIMO; Precoding; Channel state information; Control theory (sociology); Equalization (audio); Channel (broadcasting); Fading; Algorithm; Electronic engineering; Telecommunications; Wireless","score_opus":0.06374955952981218,"score_gpt":0.29156627818174197,"score_spread":0.2278167186519298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109956620","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.0028239826,0.00028828214,0.9948591,0.000087041335,0.000018515564,0.00003090777,0.000036022262,0.000041502866,0.0018146881],"genre_scores_gemma":[0.60145426,0.002108365,0.38823432,0.0002306929,0.00018573961,0.0005369869,0.00017468235,0.000054351516,0.007020525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930716,0.00022862456,0.000028543816,0.000110984925,0.0002692623,0.00005541427],"domain_scores_gemma":[0.99948347,0.00024363476,0.000081067155,0.00004812708,0.000118058924,0.000025688127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025502,0.0008935022,0.00082906167,0.00038843325,0.0004004124,0.001026304,0.00096419576,0.0008437893,0.0021105914],"category_scores_gemma":[0.0019059496,0.00038468264,0.0004946688,0.0004734694,0.00082042563,0.0011069952,0.0007014444,0.00076966727,0.0004891094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041496012,0.000038664704,0.00023445237,0.00017339858,0.000032966844,0.00023086813,0.0001843999,0.7033807,0.0075743455,0.25632823,0.0011671317,0.030613484],"study_design_scores_gemma":[0.000025546453,0.00011366726,0.00011067788,0.00002695486,0.0000131125935,0.00010714089,0.00002468413,0.9400012,0.0010139366,0.05499585,0.003546713,0.00002058795],"about_ca_topic_score_codex":0.0017933438,"about_ca_topic_score_gemma":0.0016618154,"teacher_disagreement_score":0.0021105914,"about_ca_system_score_codex":0.0010370797,"about_ca_system_score_gemma":0.0010037892,"threshold_uncertainty_score":0.00752455},"labels":[],"label_agreement":null},{"id":"W2110168847","doi":"10.1109/jsac.2005.857191","title":"An automated policy-based management framework for differentiated communication systems","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","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 Ottawa","funders":"","keywords":"Computer science; Flexibility (engineering); Quality of service; Distributed computing; A priori and a posteriori; Network management; Wireless; Wireless network; Computer network; Systems management; Telecommunications","score_opus":0.029575433781827337,"score_gpt":0.3382452541997779,"score_spread":0.30866982041795055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110168847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029173899,0.00020075131,0.9909464,0.0003325688,0.00006973348,0.00017214424,0.000053776505,0.0021930572,0.0031142263],"genre_scores_gemma":[0.20676509,0.00039022832,0.7881939,0.0002106658,0.00012254604,0.000496647,0.00029186028,0.0001792991,0.0033498153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.0003722489,0.00012777049,0.00018574439,0.0006475781,0.00014599919],"domain_scores_gemma":[0.99898416,0.00034388906,0.00011949957,0.00020470508,0.00022148807,0.00012631064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029468152,0.00059308746,0.0006497824,0.00078808377,0.0009758375,0.0026282296,0.0022921578,0.0013973076,0.0022862311],"category_scores_gemma":[0.0027942357,0.0004424829,0.00057499245,0.00053232163,0.0011012539,0.0024034097,0.0017923514,0.0018099439,0.0007852662],"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.0001416496,0.0003137386,0.00092457613,0.0002037056,0.000069121656,0.0004817044,0.000579984,0.30151224,0.009497517,0.49762124,0.01183393,0.17682064],"study_design_scores_gemma":[0.000036795664,0.000033358087,0.00008697833,0.000027555683,0.000014605433,0.00007310026,0.000028628137,0.9257191,0.0022527506,0.051489685,0.020213883,0.000023577986],"about_ca_topic_score_codex":0.0049321945,"about_ca_topic_score_gemma":0.004346821,"teacher_disagreement_score":0.0049321945,"about_ca_system_score_codex":0.0015926583,"about_ca_system_score_gemma":0.0030838973,"threshold_uncertainty_score":0.015584409},"labels":[],"label_agreement":null},{"id":"W2110744854","doi":"10.1109/jsac.2008.080211","title":"Iterative frequency domain channel estimation for dft-precoded ofdm systems using in-band pilots","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Carleton University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Frequency domain; Channel (broadcasting); Interference (communication); Single antenna interference cancellation; Frequency-division multiplexing; Multiplexing; Spectral efficiency; Algorithm; Precoding; Electronic engineering; Telecommunications; Engineering; MIMO; Computer vision","score_opus":0.06339705254167242,"score_gpt":0.315648045836058,"score_spread":0.25225099329438555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110744854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039555497,0.00010007654,0.9593278,0.000051822517,0.000011521766,0.00001670902,0.000016446143,0.00014984849,0.0007702234],"genre_scores_gemma":[0.63749284,0.00026683457,0.3609454,0.000039319715,0.000030667266,0.000046179663,0.00006552371,0.000016917993,0.0010962682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982506,0.000052425934,0.0000074737627,0.000026474485,0.000065129,0.000023536813],"domain_scores_gemma":[0.9995285,0.00028132412,0.000054737364,0.000038092185,0.00008650724,0.000010863398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026023557,0.0003423096,0.00027504694,0.0001729046,0.00019803648,0.00032060256,0.00029349036,0.0003346268,0.00062432],"category_scores_gemma":[0.001468363,0.00016140477,0.00021706871,0.00021630799,0.00028230442,0.00037487978,0.00026437113,0.0003591921,0.00013731275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022156358,0.00006790059,0.002544982,0.00012925747,0.000054857093,0.00029233732,0.00025647014,0.6960455,0.06925526,0.010105698,0.00076194236,0.22026429],"study_design_scores_gemma":[0.000009138995,0.000051778054,0.00031020917,0.000004465968,0.000009037037,0.000051460534,0.000014399695,0.98662114,0.011929521,0.0005847972,0.00040508516,0.000008989572],"about_ca_topic_score_codex":0.002874404,"about_ca_topic_score_gemma":0.0032768676,"teacher_disagreement_score":0.002874404,"about_ca_system_score_codex":0.0002532556,"about_ca_system_score_gemma":0.00069758756,"threshold_uncertainty_score":0.0057153106},"labels":[],"label_agreement":null},{"id":"W2111159763","doi":"10.1109/49.974661","title":"Design of a meta-mesh of chain subnetworks: enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs","year":2002,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network 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":"University of Alberta","funders":"University of Alberta","keywords":"Computer science; Mesh networking; Distributed computing; Computer network; Spare part; Backbone network; Optical mesh network; Shared mesh; Path (computing); Topology (electrical circuits); Theoretical computer science; Wireless mesh network; Telecommunications; Mathematics","score_opus":0.06757365478070981,"score_gpt":0.2722416191382224,"score_spread":0.2046679643575126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111159763","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.1329908,0.00012680083,0.85987717,0.00013302334,0.00002827402,0.00006573186,0.00008150054,0.00032638758,0.006370331],"genre_scores_gemma":[0.624766,0.00016843488,0.37260488,0.000041324794,0.000011323934,0.000077461606,0.000089916015,0.00006339464,0.0021772848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988663,0.00003193541,0.000006906701,0.000019061596,0.00003932339,0.00001614383],"domain_scores_gemma":[0.9998022,0.00004466149,0.000037212372,0.000047400386,0.000050526694,0.000018018596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002331863,0.00024044035,0.00018530383,0.0002656765,0.00016450451,0.00029342822,0.0005658711,0.00020450866,0.0011243236],"category_scores_gemma":[0.00034836624,0.00014708031,0.00029785535,0.00019009349,0.00022793395,0.0004117647,0.0003945149,0.00030798846,0.00019489246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013669282,0.000059698963,0.0017191005,0.0002419477,0.00004757279,0.00025833005,0.00011712268,0.621008,0.23441008,0.052235566,0.0008012643,0.088964604],"study_design_scores_gemma":[0.000027592394,0.00025393706,0.00059648475,0.000023266768,0.000027101969,0.00014608256,0.00003928213,0.93443555,0.04661259,0.009723131,0.008101129,0.000013971322],"about_ca_topic_score_codex":0.00066146196,"about_ca_topic_score_gemma":0.0011546721,"teacher_disagreement_score":0.0011243236,"about_ca_system_score_codex":0.00037490638,"about_ca_system_score_gemma":0.000343131,"threshold_uncertainty_score":0.003761232},"labels":[],"label_agreement":null},{"id":"W2111308842","doi":"10.1109/jsac.2004.829342","title":"oEvolve : Toward Evolutionary Overlay Topologies for High-Bandwidth Data Dissemination","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Computer science; Network topology; Testbed; Overlay network; Computer network; Overlay; Distributed computing; Throughput; Quality of service; Dissemination; Overlay multicast; Bandwidth (computing); Routing (electronic design automation); The Internet; Wireless; Telecommunications","score_opus":0.06477464549766751,"score_gpt":0.3455923242920603,"score_spread":0.2808176787943928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111308842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030063285,0.00017441192,0.9679052,0.00021128714,0.00002340477,0.00006749788,0.000018575181,0.0005156637,0.0010205939],"genre_scores_gemma":[0.3124211,0.00048192366,0.68489134,0.00011005614,0.000028616425,0.00013964453,0.00015210142,0.00012613896,0.0016490837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999458,0.00022017566,0.000021664815,0.00005980832,0.00020371097,0.000036562746],"domain_scores_gemma":[0.998108,0.00094176776,0.00021610488,0.00029062483,0.00028975809,0.00015373636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001830392,0.000364519,0.00042691338,0.00061574765,0.00054908235,0.00095653353,0.0013649383,0.0007778877,0.0006861574],"category_scores_gemma":[0.006042932,0.00023473486,0.00026762797,0.00053616497,0.00065160316,0.0016986334,0.0013293106,0.0008633931,0.00021151839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018001224,0.00022948944,0.002929563,0.00024076356,0.00008469412,0.00028741825,0.0006808311,0.62766284,0.05091298,0.06034329,0.0031948902,0.25325322],"study_design_scores_gemma":[0.000048106835,0.00014955075,0.0004034837,0.00001480376,0.000017400573,0.00018803286,0.00017499016,0.96113956,0.011264379,0.01684009,0.009744191,0.000015302418],"about_ca_topic_score_codex":0.0007834514,"about_ca_topic_score_gemma":0.0010685414,"teacher_disagreement_score":0.001830392,"about_ca_system_score_codex":0.0003884679,"about_ca_system_score_gemma":0.0004986245,"threshold_uncertainty_score":0.009680212},"labels":[],"label_agreement":null},{"id":"W2111388916","doi":"10.1109/jsac.2011.110511","title":"On the Impact of Link Scheduling on End-to-End Delays in Large Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","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 Toronto","funders":"","keywords":"Computer science; End-to-end principle; Scheduling (production processes); End-to-end delay; Network delay; Multiplexing; Hop (telecommunications); Statistical time division multiplexing; Computer network; Distributed computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.040576233895283774,"score_gpt":0.2916289727300065,"score_spread":0.25105273883472273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111388916","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.55031776,0.007686308,0.4213417,0.0036539568,0.00022022259,0.00008487602,0.0003459208,0.0004226119,0.015926601],"genre_scores_gemma":[0.9767363,0.001957241,0.019756163,0.00022098333,0.00017343377,0.000047942278,0.000075890035,0.0001631696,0.0008687714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967961,0.0014845297,0.00012077137,0.00032522526,0.0007208463,0.00055268046],"domain_scores_gemma":[0.8871059,0.10497672,0.0032574458,0.0022187608,0.0015949784,0.0008461928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00733174,0.0012599347,0.0010062419,0.001053336,0.0011643093,0.0020210298,0.001124323,0.0011729331,0.0016759392],"category_scores_gemma":[0.061157227,0.0005996019,0.00038392772,0.0013270089,0.0017150416,0.004637521,0.0012618707,0.0017451829,0.0002584646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038189918,0.000097367156,0.0039396207,0.00012514823,0.00006155281,0.00008910601,0.0000781406,0.94161946,0.007348758,0.020306839,0.00051137805,0.025440786],"study_design_scores_gemma":[0.000017216395,0.00019520948,0.0030379193,0.000028960065,0.000051359508,0.000087731496,0.00007370773,0.9703939,0.00641248,0.018996486,0.0006785329,0.000026419311],"about_ca_topic_score_codex":0.002922473,"about_ca_topic_score_gemma":0.003105307,"teacher_disagreement_score":0.00733174,"about_ca_system_score_codex":0.002196163,"about_ca_system_score_gemma":0.0011633963,"threshold_uncertainty_score":0.03877443},"labels":[],"label_agreement":null},{"id":"W2112539288","doi":"10.1109/jsac.2009.090104","title":"An Antennas and Propagation Approach to Improving Physical Layer Performance in Wireless Body Area Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":39,"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","keywords":"Computer science; Diversity gain; Multipath propagation; Wireless; Node (physics); Antenna diversity; Maximal-ratio combining; Physical layer; Wireless network; Diversity scheme; Diversity combining; Antenna (radio); Computer network; Electronic engineering; Telecommunications; Fading; Channel (broadcasting); Acoustics; Physics; Engineering","score_opus":0.017973681105334937,"score_gpt":0.25025402379696354,"score_spread":0.23228034269162862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112539288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06508954,0.001509131,0.92370284,0.000347685,0.000117552656,0.000030727853,0.000024366547,0.00074094895,0.008437241],"genre_scores_gemma":[0.59657454,0.0020655596,0.39364523,0.00023329517,0.00014323652,0.000070783775,0.000055014385,0.000096344374,0.0071160174],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965525,0.0001245235,0.000013449923,0.000043267337,0.00012706201,0.000036448168],"domain_scores_gemma":[0.9994696,0.00019990845,0.00007580668,0.00010937128,0.00012517137,0.0000201419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047419433,0.0006383294,0.00027496408,0.00028687104,0.00017857822,0.000665492,0.0005254859,0.0005445028,0.0010095807],"category_scores_gemma":[0.001344037,0.00025945393,0.00029653442,0.00056604156,0.00047383463,0.0010284382,0.00043265274,0.00051542604,0.0005585962],"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.00033049867,0.00017427868,0.00256029,0.00028982988,0.00013188385,0.0002333544,0.00018914293,0.11488054,0.5666048,0.043876555,0.0017030893,0.2690257],"study_design_scores_gemma":[0.000059175163,0.0017252335,0.0057923156,0.00010044084,0.00019368474,0.0014324762,0.00013013862,0.55000794,0.3953144,0.0156215355,0.029533891,0.00008881397],"about_ca_topic_score_codex":0.00023245532,"about_ca_topic_score_gemma":0.00040988406,"teacher_disagreement_score":0.0010095807,"about_ca_system_score_codex":0.0003466901,"about_ca_system_score_gemma":0.00023671763,"threshold_uncertainty_score":0.003377378},"labels":[],"label_agreement":null},{"id":"W2115539225","doi":"10.1109/jsac.2006.874419","title":"Distributed space-time coding for multihop transmission in power line communication networks","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":92,"is_retracted":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":"Retransmission; Computer science; Computer network; Node (physics); Linear network coding; Transmission (telecommunications); Telecommunications; Network packet; Engineering","score_opus":0.01508868817408692,"score_gpt":0.26108755375492165,"score_spread":0.24599886558083472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115539225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008660472,0.0012174945,0.9873899,0.00020838116,0.0000665022,0.000028431346,0.000027796475,0.00008063484,0.0023204468],"genre_scores_gemma":[0.670667,0.0035746496,0.32041645,0.00024525422,0.0001993319,0.00042496045,0.00019495632,0.000061123756,0.0042162887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940956,0.00023590335,0.000020263957,0.000041964235,0.000242006,0.000050392056],"domain_scores_gemma":[0.99874204,0.00083164696,0.000112322414,0.00013848461,0.0001512184,0.000024397594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067867537,0.00045589745,0.00037816158,0.00043166525,0.00029436155,0.0005242697,0.0006943829,0.00079958927,0.0012677255],"category_scores_gemma":[0.0031349773,0.00016974563,0.00026836357,0.0007075432,0.00080734584,0.0007425712,0.00064395036,0.00082908105,0.00035546607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006055244,0.000026539517,0.0002511845,0.00014559992,0.00001868366,0.00014785145,0.00012549497,0.69661224,0.005022392,0.2331445,0.0015946986,0.06285025],"study_design_scores_gemma":[0.000011998044,0.0000299039,0.0000465938,0.000017028317,0.000004459913,0.00003767815,0.000012304283,0.95883876,0.00078931917,0.03855916,0.0016444065,0.000008409056],"about_ca_topic_score_codex":0.0025153006,"about_ca_topic_score_gemma":0.0024421585,"teacher_disagreement_score":0.0025153006,"about_ca_system_score_codex":0.00088292634,"about_ca_system_score_gemma":0.0009170304,"threshold_uncertainty_score":0.006406069},"labels":[],"label_agreement":null},{"id":"W2117340361","doi":"10.1109/49.957309","title":"An adaptive distance-based location update algorithm for next-generation PCS networks","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":99,"is_retracted":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; Paging; Base station; Mobility model; Network topology; Boundary (topology); Algorithm; Bandwidth (computing); Wireless network; Cellular network; Path (computing); Wireless; Computer network; Real-time computing; Distributed computing; Telecommunications","score_opus":0.09890229836677501,"score_gpt":0.338317888648,"score_spread":0.239415590281225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117340361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01337287,0.00011811227,0.9850514,0.00012039233,0.00002834946,0.00002265624,0.000022885253,0.0003646388,0.0008987509],"genre_scores_gemma":[0.7308318,0.00023749462,0.26491788,0.00012221491,0.000059670878,0.0001056033,0.00015674488,0.00009462644,0.003473997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.00009470818,0.000020243227,0.000082352744,0.00021677864,0.00007371064],"domain_scores_gemma":[0.99925524,0.000344729,0.00006922826,0.000076465025,0.00020803316,0.00004634805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999566,0.00035181537,0.0007193095,0.00045683296,0.00054026436,0.0007997067,0.0015510109,0.0007738903,0.0011865427],"category_scores_gemma":[0.0030129377,0.0003276577,0.0002778905,0.00046142968,0.00052262517,0.0013731963,0.0009089339,0.00096250686,0.00036590506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005127138,0.00002289207,0.00045272757,0.000014712617,0.000010469026,0.000027996535,0.000032155232,0.95080316,0.0012279645,0.008594067,0.000793447,0.037969198],"study_design_scores_gemma":[0.0000028246484,0.000004055107,0.000025091973,5.9229137e-7,8.6903174e-7,0.0000054863403,0.00000174402,0.99881315,0.00015131632,0.00081485877,0.0001785823,0.0000014086056],"about_ca_topic_score_codex":0.014414905,"about_ca_topic_score_gemma":0.012905437,"teacher_disagreement_score":0.014414905,"about_ca_system_score_codex":0.0014801156,"about_ca_system_score_gemma":0.0014729489,"threshold_uncertainty_score":0.028662026},"labels":[],"label_agreement":null},{"id":"W2117578628","doi":"10.1109/jsac.2009.091205","title":"Channel capacity and non-uniform signalling for free-space optical intensity channels","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":108,"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":"Channel capacity; Computer science; Maximization; Channel (broadcasting); Entropy (arrow of time); Signalling; Decoding methods; Topology (electrical circuits); Mutual information; Coding (social sciences); Computation; Intensity (physics); Algorithm; Telecommunications; Mathematical optimization; Mathematics; Optics; Physics; Statistics; Artificial intelligence","score_opus":0.037795819269231555,"score_gpt":0.26389678577319203,"score_spread":0.22610096650396047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117578628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0687837,0.00042370387,0.9231648,0.00023674543,0.000021672491,0.00004769783,0.00006926981,0.00016494725,0.007087504],"genre_scores_gemma":[0.97525746,0.00025361442,0.023017904,0.000050162318,0.000022569384,0.000056265508,0.00003510531,0.000030992767,0.0012759231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987727,0.00044940112,0.000037970818,0.00013000597,0.00039028822,0.00021961985],"domain_scores_gemma":[0.99602306,0.0029135505,0.00040256337,0.00019074704,0.00039474206,0.000075263524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001614325,0.0007030751,0.0004899694,0.00049828313,0.0004264877,0.0011982888,0.00086666987,0.0005858791,0.0015203898],"category_scores_gemma":[0.006477907,0.0002880775,0.0002905844,0.000591376,0.0016458257,0.0014932283,0.0009738536,0.0006771936,0.0002167967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343309,0.000031849773,0.00022525559,0.00012217887,0.000015779553,0.000114405084,0.00007780439,0.9057191,0.011048989,0.068911105,0.00037741006,0.013252725],"study_design_scores_gemma":[0.0000071568716,0.000047430407,0.00014509886,0.000009393043,0.000005821893,0.000057578454,0.000018346438,0.98425746,0.004006558,0.011119981,0.00031335134,0.000011805157],"about_ca_topic_score_codex":0.0010471436,"about_ca_topic_score_gemma":0.0008755261,"teacher_disagreement_score":0.001614325,"about_ca_system_score_codex":0.0015077579,"about_ca_system_score_gemma":0.00093520316,"threshold_uncertainty_score":0.010939598},"labels":[],"label_agreement":null},{"id":"W2117915894","doi":"10.1109/jsac.2005.862385","title":"Improved transmit null steering for MIMO-OFDM downlinks with distributed base station antenna arrays","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Carleton University","funders":"","keywords":"Base station; Computer science; Orthogonal frequency-division multiplexing; Telecommunications link; Space-division multiple access; MIMO; Channel (broadcasting); Multiplexing; Pilot signal; Computer network; MIMO-OFDM; Interference (communication); Real-time computing; Electronic engineering; Telecommunications; Engineering","score_opus":0.013701704564588982,"score_gpt":0.24080858403215785,"score_spread":0.22710687946756886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117915894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035786383,0.00018880102,0.9618271,0.0000863865,0.000031665822,0.000014305936,0.00004268374,0.0002476529,0.0017750257],"genre_scores_gemma":[0.76190984,0.00036801986,0.23395337,0.00007780693,0.000098611796,0.000057877085,0.00018581597,0.000041877127,0.0033067248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.00018596445,0.000019572752,0.000056565354,0.00022177765,0.00004500228],"domain_scores_gemma":[0.9993838,0.00020935528,0.00008492852,0.00011006196,0.00018202202,0.000029811834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043116068,0.00044752614,0.00042229547,0.00019517085,0.0002518902,0.00035721695,0.00045979803,0.00035470477,0.0011651064],"category_scores_gemma":[0.0014875386,0.00025005417,0.00025945294,0.00041805618,0.00027682958,0.0004985613,0.0003895305,0.00041947828,0.00058348366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004427228,0.0001571003,0.0025071432,0.00010210503,0.00007835065,0.00024260963,0.00012897859,0.6906639,0.07141059,0.02232361,0.0027494144,0.20919347],"study_design_scores_gemma":[0.000022460865,0.00009237937,0.00027291424,0.000002966773,0.0000116082765,0.000060917177,0.000011382113,0.9910692,0.0054529803,0.0018174254,0.0011758774,0.00000981571],"about_ca_topic_score_codex":0.00091754814,"about_ca_topic_score_gemma":0.0019793021,"teacher_disagreement_score":0.0011651064,"about_ca_system_score_codex":0.0003550209,"about_ca_system_score_gemma":0.00035994986,"threshold_uncertainty_score":0.0038976073},"labels":[],"label_agreement":null},{"id":"W2118315922","doi":"10.1109/jsac.2009.090214","title":"A cross-layer design framework for robust IPTV services over IEEE 802.16 networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Compression Techniques","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":"University of Waterloo","funders":"Institute for Information Industry, Ministry of Science and Technology, Taiwan; Ontario Centres of Excellence","keywords":"Multicast; Computer science; Computer network; Multiple description coding; Video quality; WiMAX; IPTV; Scalable Video Coding; Real-time computing; Distributed computing; Wireless; Scalability; Telecommunications; Network packet","score_opus":0.06827897961494891,"score_gpt":0.3712560710996058,"score_spread":0.3029770914846569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118315922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014037812,0.0001603281,0.9966133,0.00007289521,0.000024764073,0.00006666345,0.000010190778,0.00014633487,0.001501732],"genre_scores_gemma":[0.301873,0.0007952522,0.69242823,0.0002235309,0.00013112437,0.00067984854,0.00010780823,0.000115776566,0.0036454592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.00030657792,0.00007488993,0.00011728052,0.00055954425,0.00010864244],"domain_scores_gemma":[0.99948883,0.0001241272,0.000075938675,0.000061326115,0.00022602298,0.000023816538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387791,0.00090982846,0.00043680402,0.0005195841,0.00045044694,0.0012184677,0.0013889981,0.0008300506,0.0017995755],"category_scores_gemma":[0.0017186727,0.00039577056,0.00064474595,0.0002577323,0.0005057913,0.0008621953,0.0008255301,0.0012679882,0.0004973903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007681575,0.000093207855,0.00046747396,0.00024923668,0.000095147974,0.00047319196,0.00026750827,0.67928296,0.037092466,0.14897491,0.0033378527,0.12958914],"study_design_scores_gemma":[0.000023628108,0.00018417559,0.0001186216,0.000031895102,0.000038318718,0.00015346488,0.000026104866,0.9720713,0.0067090592,0.010925731,0.009696554,0.0000210659],"about_ca_topic_score_codex":0.0016010358,"about_ca_topic_score_gemma":0.0014309468,"teacher_disagreement_score":0.002387791,"about_ca_system_score_codex":0.0008581828,"about_ca_system_score_gemma":0.0012440248,"threshold_uncertainty_score":0.012628019},"labels":[],"label_agreement":null},{"id":"W2118817065","doi":"10.1109/jsac.2008.080412","title":"Reduced-Complexity Belief Propagation for System-Wide MUD in the Uplink of Cellular Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Simon Fraser University","funders":"","keywords":"Computer science; Telecommunications link; Multiuser detection; Belief propagation; Base station; Fading; Path loss; Decoding methods; Cellular network; Wireless network; Computer network; Algorithm; Wireless; Distributed computing; Telecommunications; Code division multiple access","score_opus":0.09683187822944359,"score_gpt":0.3069989266246265,"score_spread":0.21016704839518294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118817065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05381068,0.00040071347,0.9438698,0.00023257654,0.000022732207,0.00001794447,0.000025161347,0.00021657582,0.0014037827],"genre_scores_gemma":[0.8750262,0.00043823378,0.12329488,0.00006741241,0.000047558962,0.000056972483,0.000050557308,0.000025482783,0.0009926225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.00032103228,0.00001766978,0.00006295246,0.00023383298,0.000068682086],"domain_scores_gemma":[0.9980641,0.0014725431,0.000119780336,0.00015825534,0.00015344162,0.000031787644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064387,0.00050120056,0.000630036,0.00037217562,0.00025398005,0.00058416225,0.00054595794,0.0007133319,0.0004362142],"category_scores_gemma":[0.0051753363,0.0003484785,0.00030883556,0.00051670946,0.0010681638,0.00080492685,0.0007671509,0.0008796699,0.00013063232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009019289,0.000015627233,0.00025399018,0.000031057785,0.000021922202,0.000043463457,0.0000441677,0.96777815,0.00249933,0.015710363,0.0002014291,0.013310401],"study_design_scores_gemma":[0.0000049613955,0.000010352504,0.000035408073,0.0000016525048,0.000003076411,0.0000051628153,0.0000014868212,0.99728847,0.00038092234,0.0021880458,0.00007802435,0.0000024909189],"about_ca_topic_score_codex":0.0035122745,"about_ca_topic_score_gemma":0.0026030156,"teacher_disagreement_score":0.0035122745,"about_ca_system_score_codex":0.0008942837,"about_ca_system_score_gemma":0.00073195004,"threshold_uncertainty_score":0.006983638},"labels":[],"label_agreement":null},{"id":"W2120122098","doi":"10.1109/jsac.2007.070603","title":"Performance Analysis of Infrastructure Service Provision with GMPLS-Based Traffic Engineering","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; Provisioning; Traffic engineering; Multiprotocol Label Switching; Internet exchange point; Distributed computing; The Internet; Internet traffic; Quality of service; Internet transit; World Wide Web","score_opus":0.009107941308712768,"score_gpt":0.23864097614448662,"score_spread":0.22953303483577386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120122098","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.9122502,0.0006496422,0.073262654,0.00044472681,0.00006422865,0.000085973494,0.0002496305,0.00079846947,0.012194409],"genre_scores_gemma":[0.99748385,0.00007384896,0.0021133714,0.000012574999,0.0000055785895,0.000009755657,0.00006964468,0.000017105569,0.00021418056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838245,0.0004304495,0.000046048794,0.00016181468,0.00050327333,0.00047594646],"domain_scores_gemma":[0.9964227,0.0019602822,0.00038332384,0.00030796294,0.00078721455,0.00013856204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015502416,0.0009117081,0.0006551563,0.0008024884,0.00053391774,0.001066445,0.00075277116,0.0006434679,0.0009661903],"category_scores_gemma":[0.005028774,0.00015590474,0.00034547644,0.0012469563,0.0007538458,0.0011002995,0.00073490373,0.00078571605,0.00019687372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044394235,0.0001205537,0.0029856483,0.00006654986,0.000050219147,0.00008230266,0.000055501394,0.967455,0.009288546,0.0054067085,0.0006114599,0.013433549],"study_design_scores_gemma":[0.000005406234,0.00011211495,0.00073369144,0.00000292354,0.000010992679,0.000021036443,0.00002662839,0.99544287,0.002833472,0.00066808175,0.00013558859,0.0000071366508],"about_ca_topic_score_codex":0.007441551,"about_ca_topic_score_gemma":0.0026157422,"teacher_disagreement_score":0.007441551,"about_ca_system_score_codex":0.001856344,"about_ca_system_score_gemma":0.0012344251,"threshold_uncertainty_score":0.014796495},"labels":[],"label_agreement":null},{"id":"W2120587829","doi":"10.1109/jsac.2011.110409","title":"Stochastic Medium Access for Cognitive Radio Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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 Waterloo","funders":"","keywords":"Computer science; Cognitive radio; Computer network; Network packet; Markov chain; Wireless ad hoc network; Throughput; SMA*; Control channel; Channel (broadcasting); Power control; Access control; Scheme (mathematics); Distributed computing; Wireless; Telecommunications link; Power (physics); Telecommunications; Algorithm","score_opus":0.07084503056711466,"score_gpt":0.31686000442307666,"score_spread":0.246014973855962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120587829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066865473,0.001371526,0.98947144,0.00020899576,0.00009540249,0.000042352895,0.00004088032,0.00017222798,0.001910529],"genre_scores_gemma":[0.8328058,0.004655585,0.15785137,0.00024679594,0.00037421344,0.0005543919,0.00018754396,0.00007518507,0.003249095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.0005628062,0.000052314543,0.00010930679,0.0004764759,0.000108406835],"domain_scores_gemma":[0.9978612,0.001478892,0.00020357274,0.00016240965,0.0002314397,0.00006251903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016295548,0.0009226627,0.00081807154,0.00061401416,0.00070023583,0.0011681247,0.0011819787,0.0009969301,0.0011914796],"category_scores_gemma":[0.0047607725,0.00045390794,0.0006456981,0.0007986789,0.0010260463,0.0011299402,0.0010103682,0.0013069478,0.0003196235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078831275,0.000049226084,0.00051921135,0.00016500666,0.00006533934,0.00019306877,0.0000712862,0.7881731,0.0035901424,0.1773062,0.0013028459,0.028485728],"study_design_scores_gemma":[0.000010713856,0.0000273961,0.00004641485,0.0000086453465,0.0000075570483,0.000025737188,0.000004645216,0.97457576,0.00019259054,0.024402853,0.00069008407,0.0000076086963],"about_ca_topic_score_codex":0.003671084,"about_ca_topic_score_gemma":0.0040775994,"teacher_disagreement_score":0.003671084,"about_ca_system_score_codex":0.001447038,"about_ca_system_score_gemma":0.0015286271,"threshold_uncertainty_score":0.01049906},"labels":[],"label_agreement":null},{"id":"W2121497908","doi":"10.1109/jsac.2008.080203","title":"Reduced-complexity equalization techniques for ISI and MIMO wireless channels in iterative decoding","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Trellis (graph); Computer science; MIMO; Fading; Decoding methods; Algorithm; Intersymbol interference; Equalization (audio); Tree (set theory); Trellis quantization; Channel (broadcasting); Space–time trellis code; Mathematics; Telecommunications; Block code; Concatenated error correction code; Artificial intelligence","score_opus":0.08285026603912156,"score_gpt":0.337846159776672,"score_spread":0.25499589373755044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121497908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055410154,0.00043766372,0.99100435,0.00006523108,0.000033388915,0.000022967897,0.000027477967,0.00034762564,0.0025201605],"genre_scores_gemma":[0.20347323,0.001133486,0.7876824,0.00016341636,0.00010838092,0.000101722144,0.00018915636,0.00016405877,0.0069842115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00016226257,0.00004693515,0.000096423784,0.00034077978,0.00008577884],"domain_scores_gemma":[0.99913496,0.00042848234,0.0000799461,0.00014064791,0.00019506147,0.000020977863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045279667,0.00075333094,0.00055324694,0.0006052724,0.00039175764,0.00074871193,0.0007185647,0.0006675638,0.002298124],"category_scores_gemma":[0.002447969,0.0002872438,0.00059998914,0.0007512093,0.0005535392,0.0010516875,0.00067598815,0.0011233744,0.0011449804],"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.00028433127,0.00008391009,0.0008468034,0.00036372454,0.00011208724,0.00031405457,0.0003747443,0.2957791,0.093848474,0.10922529,0.0030481946,0.49571925],"study_design_scores_gemma":[0.00002644959,0.00015482037,0.00033085438,0.000048515732,0.000037824724,0.000477571,0.000038083886,0.90315425,0.06698844,0.019580984,0.009115559,0.00004669906],"about_ca_topic_score_codex":0.0012897601,"about_ca_topic_score_gemma":0.002624853,"teacher_disagreement_score":0.002298124,"about_ca_system_score_codex":0.00059255236,"about_ca_system_score_gemma":0.0010589669,"threshold_uncertainty_score":0.007687986},"labels":[],"label_agreement":null},{"id":"W2122044701","doi":"10.1109/jsac.2004.839383","title":"A novel signaling nested reservation protocol for all-optical networks","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Reservation; Network packet; Resource Reservation Protocol; Wavelength-division multiplexing; Bandwidth (computing); Protocol (science); Throughput; Distributed computing; Wireless; Telecommunications; Internet protocol suite; The Internet; Wavelength","score_opus":0.06738241245702181,"score_gpt":0.3427491945865677,"score_spread":0.2753667821295459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122044701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017250076,0.0011703226,0.970136,0.0003840223,0.00050326315,0.00020505756,0.00008974874,0.0012445683,0.009016891],"genre_scores_gemma":[0.4724947,0.001269738,0.50993466,0.00039772928,0.00035756963,0.00047606617,0.00041809087,0.00014762371,0.014503865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995245,0.000091727794,0.000041602918,0.000059602127,0.00023232213,0.000050303257],"domain_scores_gemma":[0.999726,0.000069140566,0.000029105224,0.00005741041,0.00008794005,0.000030439362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143247,0.00029842753,0.00034806892,0.0002918808,0.0005743207,0.0007467798,0.0013493687,0.00044952624,0.0017930673],"category_scores_gemma":[0.0007032546,0.00018165505,0.00030001078,0.0002856135,0.0004494161,0.0016190722,0.0007667865,0.0009850693,0.000583813],"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.0005230312,0.0002743203,0.00046566947,0.0004994446,0.00007823058,0.0010200094,0.0004982954,0.035749592,0.19261615,0.3979967,0.013936079,0.35634255],"study_design_scores_gemma":[0.0001941481,0.00044468392,0.0002984654,0.00006937645,0.000105818246,0.0015260412,0.00012835796,0.6934386,0.0600504,0.06822612,0.17538098,0.00013705684],"about_ca_topic_score_codex":0.00041056605,"about_ca_topic_score_gemma":0.00058084,"teacher_disagreement_score":0.0017930673,"about_ca_system_score_codex":0.0003929364,"about_ca_system_score_gemma":0.0006900395,"threshold_uncertainty_score":0.005998373},"labels":[],"label_agreement":null},{"id":"W2122183147","doi":"10.1109/jsac.2006.1613770","title":"Design of WDM networks under economy of scale pricing and shortest path routing","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","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":"Shortest path problem; Equal-cost multi-path routing; Computer science; Constrained Shortest Path First; Private Network-to-Network Interface; K shortest path routing; Link-state routing protocol; Topology (electrical circuits); Mathematical optimization; Routing (electronic design automation); Network topology; Computer network; Mathematics; Routing protocol; Combinatorics; Theoretical computer science","score_opus":0.018416890775887308,"score_gpt":0.23949661955447013,"score_spread":0.2210797287785828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122183147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0963287,0.00041892807,0.89069486,0.00058754743,0.000051039435,0.00020907276,0.00009419245,0.00021167891,0.011403975],"genre_scores_gemma":[0.80843925,0.00050705037,0.18651795,0.000116393916,0.00005435134,0.00032748372,0.00006300442,0.000069189366,0.0039053631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990765,0.00038051853,0.000026949923,0.000124736,0.00024696006,0.00014430628],"domain_scores_gemma":[0.9994135,0.00027072677,0.0001231632,0.000054808526,0.0000881573,0.00004958479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012937648,0.0005815593,0.00078154774,0.00042039785,0.0004328947,0.0011126847,0.001191309,0.0008556047,0.0015650198],"category_scores_gemma":[0.002787265,0.00062526535,0.00038537782,0.0006125701,0.00088765315,0.0014048036,0.0011874806,0.00065212225,0.00019230778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005532681,0.0000390416,0.0002835737,0.00009084415,0.000022594208,0.000080882106,0.00004399921,0.9183808,0.005264131,0.05466016,0.0007099819,0.02036868],"study_design_scores_gemma":[0.000016509412,0.00003914851,0.000072566836,0.000005353047,0.0000065803615,0.000017206554,0.000015698528,0.9802838,0.00061182014,0.018126944,0.00080006087,0.0000043250197],"about_ca_topic_score_codex":0.0009821674,"about_ca_topic_score_gemma":0.0011467951,"teacher_disagreement_score":0.0016300147,"about_ca_system_score_codex":0.0016300147,"about_ca_system_score_gemma":0.0014424443,"threshold_uncertainty_score":0.011826575},"labels":[],"label_agreement":null},{"id":"W2122450032","doi":"10.1109/jsac.2007.070806","title":"Distributed Contention Window Control for Selfish Users in IEEE 802.11 Wireless LANs","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Nash equilibrium; Wireless network; Context (archaeology); Wireless; Game theory; Equilibrium point; Point (geometry); Network congestion; Distributed computing; Mathematical optimization; Telecommunications; Mathematical economics","score_opus":0.035469818176616784,"score_gpt":0.3104730568438081,"score_spread":0.27500323866719134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122450032","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.15638489,0.00047319516,0.84041685,0.00025379233,0.000053668606,0.00005026346,0.0000108384365,0.00012704275,0.0022295592],"genre_scores_gemma":[0.9874757,0.000118016505,0.011451574,0.000023193617,0.000024312567,0.000033063356,0.000003973053,0.000011666254,0.0008583665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868983,0.00060064043,0.000052914,0.00018094835,0.00031124623,0.00016454856],"domain_scores_gemma":[0.9961964,0.002833214,0.00035896752,0.000152178,0.00033296,0.00012628398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031355273,0.0005584469,0.00066139636,0.0004270149,0.00054158736,0.0011192817,0.0013742168,0.00061598123,0.0007180756],"category_scores_gemma":[0.007338879,0.0003611522,0.00025887377,0.0003534339,0.001565621,0.0018439523,0.0009273403,0.0008241204,0.00008188449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003547808,0.0001672071,0.001690393,0.00008851748,0.000082033395,0.0004277355,0.00076649565,0.83496594,0.013276953,0.11347153,0.0006612812,0.034047134],"study_design_scores_gemma":[0.000020995742,0.000036879785,0.00009342736,0.0000020387406,0.0000085479005,0.000018252937,0.000025889243,0.99120104,0.0005235036,0.007903017,0.00016115222,0.0000053086815],"about_ca_topic_score_codex":0.0024713627,"about_ca_topic_score_gemma":0.001688798,"teacher_disagreement_score":0.0031355273,"about_ca_system_score_codex":0.0008752947,"about_ca_system_score_gemma":0.00063247286,"threshold_uncertainty_score":0.016582489},"labels":[],"label_agreement":null},{"id":"W2123196001","doi":"10.1109/jsac.2010.100105","title":"Autonomic traffic engineering for network robustness","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":117,"is_retracted":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":"Robustness (evolution); Computer science; Distributed computing; Network topology; Computer network; Network traffic control; Complex network","score_opus":0.021352156455950243,"score_gpt":0.26001371124005845,"score_spread":0.23866155478410822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123196001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018186871,0.0007451967,0.96959937,0.0006751641,0.00010526324,0.000039613933,0.000026258804,0.00038527057,0.010237128],"genre_scores_gemma":[0.8415482,0.0010820525,0.15296343,0.00029975473,0.00027321104,0.00017945645,0.000060074966,0.00019491374,0.0033988503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00019398135,0.0000351943,0.00012269993,0.00022323603,0.00007603587],"domain_scores_gemma":[0.9986908,0.0006573918,0.0001671218,0.00022126787,0.00019399931,0.0000694189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110741,0.0005700383,0.00043911295,0.00072638853,0.00062547816,0.0013112775,0.00065902807,0.0006555539,0.0014665828],"category_scores_gemma":[0.0038512931,0.00020735375,0.000491315,0.0004890978,0.0012790777,0.0015110349,0.0013575655,0.0012132799,0.00022645401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046757963,0.000050613806,0.00048577692,0.00011605919,0.000044124972,0.00010245226,0.00010209791,0.5962804,0.017618576,0.30891624,0.0015971264,0.07463976],"study_design_scores_gemma":[0.000009594187,0.000052000098,0.00016547836,0.00002214272,0.00001802054,0.00007343218,0.000021928141,0.83069,0.0039674453,0.15922232,0.0057434724,0.000014127405],"about_ca_topic_score_codex":0.0006437847,"about_ca_topic_score_gemma":0.00051378994,"teacher_disagreement_score":0.0014665828,"about_ca_system_score_codex":0.0009938685,"about_ca_system_score_gemma":0.00074953324,"threshold_uncertainty_score":0.0072110295},"labels":[],"label_agreement":null},{"id":"W2123267194","doi":"10.1109/twc.2007.026506","title":"Long-lifetime capacity upgrades of ring networks for unpredictable traffic","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; The Internet; Distributed computing; Chordal graph; Graph; Theoretical computer science","score_opus":0.028420017310033446,"score_gpt":0.27572639394101967,"score_spread":0.24730637663098623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123267194","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.92399246,0.00068597175,0.07070817,0.00025230725,0.00002936602,0.000025384259,0.00012871817,0.00019268418,0.003984808],"genre_scores_gemma":[0.99623364,0.00010409954,0.0032640293,0.000007935119,0.0000038394355,0.000009187273,0.000025112597,0.0000071068057,0.00034504296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998398,0.000053490665,0.000004902182,0.00002019222,0.000031371706,0.000050327715],"domain_scores_gemma":[0.99842465,0.0009443707,0.00023772525,0.00014810769,0.00015377178,0.000091380956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470544,0.00019206536,0.00024095053,0.00035584223,0.00038331863,0.00032702982,0.00047494416,0.0003290275,0.0011043219],"category_scores_gemma":[0.004057314,0.00012703358,0.00021821042,0.00026867155,0.00040060896,0.0011534567,0.00041292387,0.00033248728,0.000087360844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018064967,0.000030144824,0.0033491058,0.000040163308,0.000017208416,0.00014013173,0.000075740805,0.97033757,0.006146797,0.006790871,0.0005410729,0.012350594],"study_design_scores_gemma":[0.0000056986537,0.000066219916,0.00091101637,0.000004645534,0.000008685492,0.00006739821,0.000053163192,0.9939964,0.002124366,0.002428124,0.00032820008,0.0000061563164],"about_ca_topic_score_codex":0.0015542442,"about_ca_topic_score_gemma":0.0018684169,"teacher_disagreement_score":0.0015542442,"about_ca_system_score_codex":0.00063419825,"about_ca_system_score_gemma":0.00025207133,"threshold_uncertainty_score":0.0055374503},"labels":[],"label_agreement":null},{"id":"W2124637714","doi":"10.1109/jsac.2005.863884","title":"A time-division multiple-access SC-FDE system with IBI suppression for UWB communications","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Ultra-Wideband Communications Technology","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":"Time division multiple access; Computer science; Code division multiple access; Transmission (telecommunications); Computer network; Phase-shift keying; Electronic engineering; Cyclic prefix; Channel (broadcasting); Bit error rate; Orthogonal frequency-division multiplexing; Telecommunications; Engineering","score_opus":0.020436945152528,"score_gpt":0.2716599058286577,"score_spread":0.2512229606761297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124637714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071782485,0.0009943297,0.9230142,0.0002825638,0.0001637598,0.00009184077,0.000038064634,0.00039284458,0.0032398724],"genre_scores_gemma":[0.6021418,0.00078282796,0.3921513,0.00019242383,0.00016318126,0.00013253644,0.000083196486,0.0000106184225,0.0043421625],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998374,0.000036217887,0.000009958789,0.000029489445,0.00007151268,0.000015317159],"domain_scores_gemma":[0.99982613,0.00004375404,0.000024550955,0.000025594627,0.00006654652,0.000013541229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023421418,0.00036571236,0.00038176693,0.00020801238,0.000374127,0.000379844,0.0006863143,0.0006667544,0.00079793454],"category_scores_gemma":[0.0003541734,0.0001658059,0.00024640994,0.00031448025,0.0003008073,0.0005181928,0.000280881,0.0005454648,0.00044277104],"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.00049478194,0.0002547694,0.0024737115,0.00057961664,0.000104213206,0.00094139134,0.00031590782,0.046426613,0.64888775,0.030259948,0.0027181495,0.26654315],"study_design_scores_gemma":[0.00015633937,0.0010465349,0.0011146776,0.000044779077,0.00014250835,0.002068954,0.00005776949,0.8761469,0.09473361,0.0033782655,0.021047456,0.00006215803],"about_ca_topic_score_codex":0.0003318362,"about_ca_topic_score_gemma":0.0006786282,"teacher_disagreement_score":0.00079793454,"about_ca_system_score_codex":0.000170457,"about_ca_system_score_gemma":0.00029465498,"threshold_uncertainty_score":0.0026693344},"labels":[],"label_agreement":null},{"id":"W2125590942","doi":"10.1109/49.857919","title":"SINR maximizing space-time filtering for asynchronous DS-CDMA","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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":"McGill University","funders":"","keywords":"Computer science; Code division multiple access; Matched filter; Spread spectrum; CDMA spectral efficiency; Filter (signal processing); Asynchronous communication; Process gain; Electronic engineering; Bandwidth (computing); Signal-to-interference-plus-noise ratio; Algorithm; Telecommunications; Detector; Engineering","score_opus":0.040188525451382004,"score_gpt":0.31284386397299396,"score_spread":0.27265533852161195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125590942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017647568,0.00034207976,0.97781163,0.000088571396,0.00003489741,0.000014433217,0.000026081523,0.00009387661,0.0039407588],"genre_scores_gemma":[0.7546698,0.0014489173,0.23383884,0.00014679559,0.00018618621,0.00011846855,0.00011105785,0.000065225315,0.009414686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996222,0.00009734895,0.0000139721005,0.000061346815,0.00016290587,0.000042185697],"domain_scores_gemma":[0.999582,0.0002485387,0.00005355746,0.000022873268,0.000077854704,0.000015307316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053507264,0.0006439799,0.00048523652,0.0002177316,0.00024066995,0.00079377263,0.00041478933,0.0007654385,0.0011963078],"category_scores_gemma":[0.0018903932,0.00024888487,0.0002737436,0.00040358346,0.00056648575,0.0005456814,0.00043181775,0.00047557065,0.00043036937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021964255,0.000100730256,0.00089620013,0.00029638104,0.000055716293,0.00015435254,0.00020877447,0.7074531,0.063081525,0.10702472,0.002313314,0.11819553],"study_design_scores_gemma":[0.000010519903,0.00006445119,0.00017904406,0.000009306501,0.000010382825,0.000027507407,0.0000114638415,0.9896773,0.0034769175,0.0056448593,0.000880261,0.000007939695],"about_ca_topic_score_codex":0.0018243176,"about_ca_topic_score_gemma":0.0020261083,"teacher_disagreement_score":0.0018243176,"about_ca_system_score_codex":0.0006924308,"about_ca_system_score_gemma":0.0008559622,"threshold_uncertainty_score":0.0050239563},"labels":[],"label_agreement":null},{"id":"W2125956815","doi":"10.1109/jsac.2003.816598","title":"Extending the p-cycle concept to path segment protection for span and node failure recovery","year":2003,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Path protection; Computer science; Spare part; Backup; Path (computing); Span (engineering); Node (physics); Network Access Protection; Computer network; Optical mesh network; Distributed computing; Telecommunications; Wavelength-division multiplexing; Engineering; Operations management","score_opus":0.0213298185487151,"score_gpt":0.26215621822687285,"score_spread":0.24082639967815775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125956815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007866825,0.00034969015,0.9850831,0.00015461125,0.00007429331,0.000060069615,0.000030178036,0.00020705951,0.006174193],"genre_scores_gemma":[0.49063843,0.0019156531,0.49540928,0.000410497,0.00019431165,0.00029682185,0.00013771711,0.00022845835,0.010768795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.000060563907,0.000016795197,0.00006313658,0.000110042645,0.0000444906],"domain_scores_gemma":[0.9994848,0.00017728245,0.00006171732,0.00013517276,0.000109725224,0.000031251235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047366894,0.0004964191,0.00026641588,0.0008198052,0.00052212353,0.0006028061,0.0008971274,0.00051489036,0.00287233],"category_scores_gemma":[0.0013709057,0.00021672933,0.0005786309,0.00077580527,0.0010189795,0.001683228,0.0009410707,0.0010400837,0.00045930987],"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.00010121021,0.00008170327,0.00086434226,0.0003097031,0.000046295492,0.00025404093,0.0002621238,0.1423561,0.0309289,0.42190582,0.004546076,0.39834374],"study_design_scores_gemma":[0.00004755103,0.0006390022,0.00071499223,0.00013099481,0.000074306,0.0013046471,0.00011073335,0.50480765,0.03953559,0.31917375,0.13337636,0.00008451275],"about_ca_topic_score_codex":0.0016683326,"about_ca_topic_score_gemma":0.0015212384,"teacher_disagreement_score":0.00287233,"about_ca_system_score_codex":0.0006381667,"about_ca_system_score_gemma":0.0012741855,"threshold_uncertainty_score":0.009608865},"labels":[],"label_agreement":null},{"id":"W2126289807","doi":"10.1109/49.840196","title":"Random coding error exponents for flat fading channels with realistic channel estimation","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Queen's University","funders":"United States Agency for International Development","keywords":"Fading; Channel state information; Computer science; Rayleigh fading; Algorithm; Multipath propagation; Channel (broadcasting); Telecommunications; Decoding methods; Wireless","score_opus":0.04023274166820819,"score_gpt":0.30574625312893455,"score_spread":0.2655135114607264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126289807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.279129,0.0036056805,0.7057154,0.0005317542,0.00011574142,0.00007580309,0.0002094296,0.00038491265,0.010232217],"genre_scores_gemma":[0.9741135,0.0019089128,0.022507671,0.00007331755,0.00006272523,0.000054286487,0.0001158875,0.000040648465,0.0011230549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880373,0.0003901009,0.00006792708,0.00012436003,0.0004049126,0.00020901157],"domain_scores_gemma":[0.9831293,0.013256311,0.0012533809,0.0011755669,0.0010729019,0.00011240093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023612238,0.0007634425,0.0005582769,0.0008487008,0.00032914893,0.0009798757,0.0004844474,0.00069001055,0.0008768745],"category_scores_gemma":[0.02239869,0.00026151002,0.0002719082,0.000709781,0.0010540055,0.0021772804,0.0006792714,0.0008311614,0.00022195515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105073086,0.00003109487,0.0016638142,0.00012922203,0.000023622253,0.00053866336,0.00015327796,0.89422035,0.006629737,0.08173952,0.0006234554,0.014142084],"study_design_scores_gemma":[0.00000978095,0.00008888351,0.0011163811,0.00005962982,0.00001804542,0.00041421526,0.00006844989,0.96278477,0.0040203715,0.030852042,0.0005320095,0.000035400968],"about_ca_topic_score_codex":0.0012700828,"about_ca_topic_score_gemma":0.0011167651,"teacher_disagreement_score":0.0023612238,"about_ca_system_score_codex":0.00076476886,"about_ca_system_score_gemma":0.0007093803,"threshold_uncertainty_score":0.012487471},"labels":[],"label_agreement":null},{"id":"W2126831583","doi":"10.1109/jsac.2008.080807","title":"Multiple Frequency Offset Estimation for the Downlink of Coordinated MIMO Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Simon Fraser University","funders":"","keywords":"Cramér–Rao bound; Carrier frequency offset; Estimator; Computer science; Telecommunications link; Beamforming; Upper and lower bounds; Algorithm; Signal-to-noise ratio (imaging); Frequency offset; MIMO; Estimation theory; Mathematical optimization; Statistics; Telecommunications; Mathematics; Orthogonal frequency-division multiplexing","score_opus":0.034029029333477824,"score_gpt":0.27302662916512077,"score_spread":0.23899759983164295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126831583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009302786,0.00037211087,0.9895845,0.000089537156,0.000012845797,0.000005785252,0.000026836642,0.000066628214,0.00053903786],"genre_scores_gemma":[0.60310274,0.0016702281,0.39257097,0.00011111347,0.00016547918,0.00008064211,0.00015603674,0.00006655593,0.0020761748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972194,0.00009673366,0.0000105165,0.00005947489,0.00007781817,0.000033480064],"domain_scores_gemma":[0.9992797,0.0004880358,0.000087564695,0.000056562174,0.000070393966,0.000017780365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049954647,0.00067873456,0.00059859175,0.00029278718,0.00022511372,0.0005643231,0.00032978813,0.0006235681,0.00068774365],"category_scores_gemma":[0.003236843,0.000251576,0.0002776355,0.00049393706,0.00048181525,0.00059440004,0.0005256089,0.0006079447,0.00025407766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005664096,0.000013176636,0.0009267316,0.000066842105,0.000026016442,0.00008394688,0.00006682897,0.91802627,0.00647754,0.017811753,0.00072756084,0.055716705],"study_design_scores_gemma":[0.000005353069,0.00003031815,0.00026460094,0.000008373453,0.000007766996,0.0000378126,0.00001196436,0.99244493,0.0016129083,0.004788285,0.0007798596,0.000007803004],"about_ca_topic_score_codex":0.0027165532,"about_ca_topic_score_gemma":0.0031123133,"teacher_disagreement_score":0.0027165532,"about_ca_system_score_codex":0.0004671363,"about_ca_system_score_gemma":0.0006874085,"threshold_uncertainty_score":0.0054014325},"labels":[],"label_agreement":null},{"id":"W2127297430","doi":"10.1109/jsac.2015.2481212","title":"Real-Time Energy Storage Management With Renewable Integration: Finite-Time Horizon Approach","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Smart Grid Energy Management","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":"Ontario Tech University","funders":"","keywords":"Computer science; Mathematical optimization; Lyapunov optimization; Time horizon; Renewable energy; Optimization problem; Dynamic programming; Energy management; System dynamics; Lyapunov function; Energy (signal processing); Lyapunov equation; Nonlinear system; Algorithm; Mathematics","score_opus":0.021570470876801105,"score_gpt":0.22653082313763445,"score_spread":0.20496035226083334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127297430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017295897,0.0005093786,0.9765024,0.00031097524,0.000048570582,0.00003260026,0.000037594986,0.000116814284,0.005145648],"genre_scores_gemma":[0.96313477,0.00051847554,0.034014776,0.000066580076,0.0000357097,0.00006238874,0.000028233188,0.000020168807,0.0021189002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975365,0.000077944824,0.0000110952105,0.000042146115,0.000077174096,0.000037981838],"domain_scores_gemma":[0.9996012,0.00023946776,0.00006955809,0.000018665487,0.00005135558,0.000019749761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055535947,0.0005574009,0.00065698836,0.00025639482,0.0003067726,0.00082387665,0.0008172585,0.00065452536,0.0019703843],"category_scores_gemma":[0.0010952005,0.00026543648,0.0004776824,0.0003697535,0.0005674698,0.00089717866,0.00050638005,0.0006856612,0.00011694253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003319016,0.000021966163,0.00014509205,0.00006756705,0.000016016747,0.00006312903,0.00003012937,0.9710617,0.0013589025,0.015768845,0.00028762026,0.011145853],"study_design_scores_gemma":[0.0000035234934,0.000013977854,0.00003635953,0.0000039571223,0.0000042462957,0.0000067805154,0.000004408977,0.9967451,0.00034509762,0.002660293,0.00017300797,0.000003118283],"about_ca_topic_score_codex":0.003966782,"about_ca_topic_score_gemma":0.0032616742,"teacher_disagreement_score":0.003966782,"about_ca_system_score_codex":0.000924663,"about_ca_system_score_gemma":0.00097447686,"threshold_uncertainty_score":0.007887363},"labels":[],"label_agreement":null},{"id":"W2132159417","doi":"10.1109/jsac.2005.864008","title":"Outage probability analysis of a MC-DS-CDMA system with variable repetition code rate and spreading factor","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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 Toronto","funders":"","keywords":"Subcarrier; Computer science; Repetition code; Code division multiple access; Code rate; Code (set theory); Bit error rate; Channel (broadcasting); Algorithm; Outage probability; Fading; Telecommunications; Electronic engineering; Statistics; Mathematics; Block code; Decoding methods; Linear code; Orthogonal frequency-division multiplexing","score_opus":0.03539580522560002,"score_gpt":0.2895408645753915,"score_spread":0.2541450593497915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132159417","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.6041467,0.0021158229,0.38278067,0.00072188134,0.00005691313,0.00004574682,0.00026357177,0.00047242705,0.009396217],"genre_scores_gemma":[0.99624544,0.00019372282,0.0029986312,0.000019557996,0.000020994095,0.000008466138,0.00003132359,0.000011566906,0.00047012058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988158,0.0004239215,0.000044629385,0.0001103113,0.0003743114,0.00023099089],"domain_scores_gemma":[0.99316436,0.005079683,0.0006060929,0.00025672084,0.00075207534,0.0001410976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015035148,0.0006144567,0.000728379,0.00069130823,0.00051905273,0.0007079699,0.0005959447,0.000771399,0.0010863463],"category_scores_gemma":[0.006539522,0.0004119402,0.0003469976,0.000705084,0.0010907638,0.00073741557,0.000675164,0.00069468434,0.00016995163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000387569,0.000039349194,0.006654895,0.0001662511,0.0001020914,0.0010953315,0.0004623493,0.93358815,0.012769235,0.031882532,0.0007748793,0.012077333],"study_design_scores_gemma":[0.000006227175,0.000035282515,0.0013908031,0.000006585738,0.00002081708,0.00014731953,0.000038168273,0.9950588,0.0009655832,0.0021735728,0.00014389341,0.000012974068],"about_ca_topic_score_codex":0.007036437,"about_ca_topic_score_gemma":0.0034211252,"teacher_disagreement_score":0.007036437,"about_ca_system_score_codex":0.0014585332,"about_ca_system_score_gemma":0.00063148746,"threshold_uncertainty_score":0.013990998},"labels":[],"label_agreement":null},{"id":"W2133037408","doi":"10.1109/jsac.2005.853811","title":"An eigen-assisted noncoherent receiver for Alamouti-type space-time modulation","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Simon Fraser University","funders":"","keywords":"Differential coding; Transmitter; Algorithm; Phase-shift keying; Detector; Computer science; Demodulation; Keying; Encoder; Fading; Rayleigh fading; Mathematics; Topology (electrical circuits); Decoding methods; Bit error rate; Telecommunications; Channel (broadcasting); Combinatorics","score_opus":0.032419911113649315,"score_gpt":0.3174079374342216,"score_spread":0.28498802632057224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133037408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08469805,0.0005044112,0.9121413,0.00013006714,0.000037658057,0.000033644494,0.000034135097,0.0001555446,0.0022651567],"genre_scores_gemma":[0.66851497,0.00033862257,0.32775334,0.00009022321,0.000055377444,0.000039256807,0.000057868267,0.000015254279,0.0031351375],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969304,0.000116149124,0.000012052751,0.000041659292,0.000109762004,0.000027340038],"domain_scores_gemma":[0.9998098,0.000075795535,0.00002838754,0.000029649225,0.000047625363,0.000008699324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048875663,0.00028441325,0.00033941877,0.00013705503,0.00017103498,0.00034829896,0.00048295746,0.00047637688,0.0007429577],"category_scores_gemma":[0.0005766843,0.00015170417,0.00019484898,0.00018333686,0.00028021738,0.0005296988,0.00028775664,0.0003541889,0.0002696056],"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.00058163796,0.00021408878,0.0055255787,0.00025764309,0.00014621826,0.000511817,0.00023544289,0.33682898,0.37356648,0.14660986,0.00147347,0.13404879],"study_design_scores_gemma":[0.00001698159,0.00015796139,0.0004144163,0.000005212286,0.000015771986,0.00013743895,0.000016193271,0.9537205,0.04008614,0.0038121848,0.0016006676,0.000016466547],"about_ca_topic_score_codex":0.00027840948,"about_ca_topic_score_gemma":0.00073220045,"teacher_disagreement_score":0.0007429577,"about_ca_system_score_codex":0.00027699803,"about_ca_system_score_gemma":0.0003551558,"threshold_uncertainty_score":0.002584815},"labels":[],"label_agreement":null},{"id":"W2134138008","doi":"10.1109/jsac.2003.809627","title":"Investigation on MIMO channels in subway tunnels","year":2003,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":135,"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":"Centre National de la Recherche Scientifique; Institut national de la recherche scientifique","keywords":"Computer science; Channel (broadcasting); MIMO; Channel capacity; Precoding; Spatial correlation; Matrix (chemical analysis); Electronic engineering; Statistical analysis; Telecommunications; Topology (electrical circuits); Algorithm; Electrical engineering; Mathematics; Statistics; Engineering","score_opus":0.0824287431986557,"score_gpt":0.271386365431167,"score_spread":0.1889576222325113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134138008","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.91245097,0.0003194776,0.081623435,0.0001114254,0.00002746549,0.000027846043,0.00019404304,0.00013631387,0.0051089516],"genre_scores_gemma":[0.9954,0.00021410789,0.003342609,0.000014904314,0.000017445494,0.000008762053,0.00005495663,0.0000074062145,0.0009397556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00015665947,0.000007175598,0.000037769587,0.00014313773,0.000109639645],"domain_scores_gemma":[0.9977366,0.0015228135,0.00025974333,0.00010716304,0.0003029074,0.00007076785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044723338,0.0003771053,0.00036542345,0.0004287045,0.00029514168,0.00042310517,0.00017814676,0.00031666626,0.0015217403],"category_scores_gemma":[0.0014313203,0.00021615294,0.00024752368,0.0005023274,0.0004615381,0.0005882117,0.00029868542,0.00032499805,0.00021683249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007145493,0.00015135868,0.019616466,0.00030367938,0.000094908806,0.001743499,0.0004752778,0.8146065,0.10301852,0.029851075,0.0009053814,0.028518826],"study_design_scores_gemma":[0.000021720154,0.00043736177,0.0134704,0.000027438158,0.00003723598,0.0010669498,0.00040199462,0.942647,0.03388187,0.0062668365,0.0016672245,0.00007408748],"about_ca_topic_score_codex":0.0012469628,"about_ca_topic_score_gemma":0.0013148079,"teacher_disagreement_score":0.0015217403,"about_ca_system_score_codex":0.00022699704,"about_ca_system_score_gemma":0.00038652887,"threshold_uncertainty_score":0.0050907135},"labels":[],"label_agreement":null},{"id":"W2134968843","doi":"10.1109/jsac.2013.131011","title":"Optimal Relay Selection for Physical-Layer Security in Cooperative Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":512,"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":"Relay; Eavesdropping; Selection (genetic algorithm); Cooperative diversity; Wireless network; Wireless; Outage probability; Relay channel","score_opus":0.041135545299955015,"score_gpt":0.3173365994603299,"score_spread":0.2762010541603749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134968843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033449512,0.0013469358,0.9625902,0.00024933633,0.000024088422,0.000029132072,0.00001906771,0.00008776074,0.0022039213],"genre_scores_gemma":[0.9477713,0.00149197,0.04975652,0.00007981474,0.0000534941,0.00006825868,0.00001813994,0.000018089304,0.00074249116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980323,0.00092727656,0.00007213339,0.00023997,0.00053760293,0.00019067724],"domain_scores_gemma":[0.9966641,0.0024507737,0.0003377222,0.00021510065,0.00028931213,0.000042881275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021510434,0.00079860364,0.0007188257,0.0005095124,0.0004538675,0.0011938477,0.00073397526,0.0008130206,0.00069270906],"category_scores_gemma":[0.007820124,0.00039717843,0.00054019585,0.0006680548,0.0019451763,0.0017061651,0.0010757815,0.0007278409,0.00018243444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012536219,0.000044951867,0.0013582978,0.00018431002,0.00007218317,0.00036314919,0.0004049219,0.7892784,0.0103017595,0.16523248,0.00070630474,0.031927876],"study_design_scores_gemma":[0.000012010968,0.00008132032,0.00018349235,0.000018628623,0.000019276315,0.0001151414,0.000053667754,0.9627448,0.0016635814,0.034434237,0.00065910746,0.000014819251],"about_ca_topic_score_codex":0.0010936246,"about_ca_topic_score_gemma":0.00077828363,"teacher_disagreement_score":0.0021510434,"about_ca_system_score_codex":0.0012333913,"about_ca_system_score_gemma":0.0012002633,"threshold_uncertainty_score":0.011375964},"labels":[],"label_agreement":null},{"id":"W2135033587","doi":"10.1109/jsac.2005.857212","title":"QoS-aware service composition and adaptation in autonomic communication","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Provisioning; Mobile QoS; Service (business); Service provider","score_opus":0.025515801205264744,"score_gpt":0.27315612987128524,"score_spread":0.24764032866602048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135033587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052139916,0.00049216533,0.94304,0.00028814338,0.000043797245,0.000071692826,0.000015291107,0.0005620935,0.003346809],"genre_scores_gemma":[0.6854528,0.00043469894,0.3118387,0.00012352393,0.00005424037,0.00010451247,0.00006092834,0.00008457094,0.0018459699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991565,0.00038578385,0.000047447946,0.00013276443,0.00018324688,0.00009436772],"domain_scores_gemma":[0.9990908,0.00049753935,0.00008900344,0.00016001884,0.00011041115,0.000052283915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016071261,0.00043021247,0.00056849566,0.0007446465,0.0010455312,0.0009559569,0.00090194854,0.0007243013,0.0007604836],"category_scores_gemma":[0.0028641692,0.0003232047,0.00032939817,0.0010565122,0.0011184765,0.0013313295,0.000928813,0.00072332047,0.00020695517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019397296,0.00010033324,0.0016508864,0.00009623572,0.00004819269,0.00016925078,0.0003697521,0.7269425,0.008956214,0.05889939,0.0016192736,0.20095402],"study_design_scores_gemma":[0.000011854555,0.000018365668,0.00018663026,0.000006083248,0.000008594953,0.00006810086,0.000046907146,0.9731399,0.0020248597,0.022807594,0.001673002,0.000008051935],"about_ca_topic_score_codex":0.0034667908,"about_ca_topic_score_gemma":0.0025565978,"teacher_disagreement_score":0.0034667908,"about_ca_system_score_codex":0.0008664152,"about_ca_system_score_gemma":0.00095214596,"threshold_uncertainty_score":0.008499384},"labels":[],"label_agreement":null},{"id":"W2135265541","doi":"10.1109/jsac.2004.823442","title":"Multiuser Detection of DS-CDMA Signals Using Partial Parallel Interference Cancellation in Satellite Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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":"Concordia University","funders":"","keywords":"Single antenna interference cancellation; Computer science; Multiuser detection; Code division multiple access; Detector; Time division multiple access; Interference (communication); Electronic engineering; Real-time computing; Telecommunications; Algorithm; Engineering","score_opus":0.10098041512326189,"score_gpt":0.3602062823102976,"score_spread":0.2592258671870357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135265541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07210542,0.0027570408,0.9207859,0.00016031993,0.00006722499,0.000033370154,0.000019884696,0.00014691091,0.0039240126],"genre_scores_gemma":[0.76823944,0.0023214223,0.22486804,0.00010565134,0.000100647514,0.00004349772,0.000059370537,0.000017546701,0.00424447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995976,0.00014513338,0.000012635342,0.000053167765,0.00016048492,0.000030999323],"domain_scores_gemma":[0.99967694,0.00018317945,0.000028431261,0.0000325276,0.00006668708,0.000012096406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004044593,0.00029938933,0.0003125288,0.0003931363,0.00024454598,0.0004123999,0.00028006113,0.00046247663,0.00041253355],"category_scores_gemma":[0.0008570587,0.00020996475,0.00023929594,0.00061601266,0.00044874058,0.00040224666,0.0004195753,0.00034376277,0.00013587183],"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.00038206726,0.00011393805,0.0036018137,0.00057369453,0.00012886601,0.00044220602,0.00030156263,0.24830513,0.20151521,0.047887072,0.0020502796,0.49469814],"study_design_scores_gemma":[0.000012492358,0.00019619147,0.0008651133,0.0000154434,0.000028249373,0.00036104236,0.000025605143,0.9418696,0.047000613,0.0056413356,0.0039579207,0.000026331838],"about_ca_topic_score_codex":0.00083905127,"about_ca_topic_score_gemma":0.0014583624,"teacher_disagreement_score":0.00083905127,"about_ca_system_score_codex":0.0002892527,"about_ca_system_score_gemma":0.00038289663,"threshold_uncertainty_score":0.002139032},"labels":[],"label_agreement":null},{"id":"W2135846425","doi":"10.1109/jsac.2007.070108","title":"Distributed pattern matching: a key to flexible and efficient P2P search","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","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":"University of Waterloo","funders":"","keywords":"Computer science; Distributed hash table; Distributed computing; Overhead (engineering); Hash table; Matching (statistics); Service discovery; Peer-to-peer; Theoretical computer science; Hash function; Computer security","score_opus":0.03778736789509546,"score_gpt":0.32142386260348016,"score_spread":0.2836364947083847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135846425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037634973,0.00079473347,0.98910207,0.0010361513,0.00007244648,0.00014791742,0.00008741306,0.00067761366,0.0043182443],"genre_scores_gemma":[0.2165724,0.0024547917,0.77443206,0.00046149097,0.00032373567,0.0004954483,0.0004074382,0.0002261195,0.004626515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969037,0.00063216593,0.0003071959,0.00061907916,0.0013223594,0.00021542975],"domain_scores_gemma":[0.9940825,0.0022908833,0.00050023675,0.002365331,0.00055699184,0.00020414992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027493238,0.00065788435,0.0015388216,0.0012872007,0.0014396331,0.003491858,0.003078743,0.0029615543,0.003472497],"category_scores_gemma":[0.0116179045,0.0008165171,0.000780073,0.0032921173,0.0026905867,0.010098415,0.0046707187,0.0024672905,0.0021313264],"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.0002093684,0.00015951287,0.0013527919,0.0007374015,0.00010424889,0.00055492425,0.00038283507,0.056539558,0.0302186,0.5097177,0.012607055,0.38741598],"study_design_scores_gemma":[0.00013276687,0.00017468994,0.00050648383,0.00010531711,0.000059622147,0.00211888,0.0001897848,0.22751336,0.01828182,0.67077845,0.08005984,0.00007903647],"about_ca_topic_score_codex":0.00079703936,"about_ca_topic_score_gemma":0.0004621875,"teacher_disagreement_score":0.003491858,"about_ca_system_score_codex":0.00082186464,"about_ca_system_score_gemma":0.0017329373,"threshold_uncertainty_score":0.014540017},"labels":[],"label_agreement":null},{"id":"W2136133839","doi":"10.1109/jsac.2011.110304","title":"Optimal Distributed Vertical Handoff Strategies in Vehicular Heterogeneous Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Computer science; Handover; Computer network; Transmission (telecommunications); Heterogeneous network; Vertical handover; Wireless network; Wireless ad hoc network; Cellular network; Vehicular ad hoc network; Wireless; Telecommunications","score_opus":0.0435194600275318,"score_gpt":0.28895316208354094,"score_spread":0.24543370205600915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136133839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28864923,0.0010078644,0.7054086,0.00027841222,0.0000730121,0.000095831296,0.000073536205,0.00020218513,0.004211393],"genre_scores_gemma":[0.9905061,0.00010877759,0.008785436,0.000023643446,0.00001238277,0.000020819354,0.000017664337,0.0000078808525,0.0005172011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.00023898322,0.00003779789,0.00011116974,0.00013259231,0.00026792102],"domain_scores_gemma":[0.9986759,0.00071665726,0.00022576313,0.00008235873,0.0001475612,0.00015188941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014022953,0.00096439733,0.0009796824,0.00064457854,0.0005491959,0.0009534241,0.0011799077,0.00074448815,0.00079631887],"category_scores_gemma":[0.0023200326,0.0004785702,0.00031260512,0.000536168,0.00079434994,0.0009926553,0.0012017179,0.0004414597,0.0001258093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020138962,0.000057950663,0.0005775728,0.000033343138,0.00003983894,0.000116806405,0.00005299747,0.96961975,0.0028406444,0.005203939,0.00033382684,0.020922039],"study_design_scores_gemma":[0.00002331297,0.00006567388,0.00018916445,0.0000034559725,0.000011134704,0.000017242444,0.00005042926,0.9953934,0.00041417012,0.003693775,0.00013144028,0.000006719638],"about_ca_topic_score_codex":0.0041312147,"about_ca_topic_score_gemma":0.004124742,"teacher_disagreement_score":0.0041312147,"about_ca_system_score_codex":0.0010699864,"about_ca_system_score_gemma":0.0006749411,"threshold_uncertainty_score":0.0082143545},"labels":[],"label_agreement":null},{"id":"W2136253824","doi":"10.1109/jsac.2009.091219","title":"Soft-Switching Hybrid FSO/RF Links Using Short-Length Raptor Codes: Design and Implementation","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":176,"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; Raptor code; Bit error rate; Forward error correction; Encoder; Gigabit; Electronic engineering; Radio frequency; Real-time computing; Free-space optical communication; Computer network; Low-density parity-check code; Optical communication; Telecommunications; Decoding methods","score_opus":0.047841870351648254,"score_gpt":0.32543255139522664,"score_spread":0.27759068104357837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136253824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27529934,0.0014660275,0.7054356,0.00024152489,0.00009165048,0.00041633417,0.00016253718,0.0036053148,0.013281671],"genre_scores_gemma":[0.73421466,0.0004080913,0.2611089,0.000053562308,0.000022089796,0.00022652611,0.00009171723,0.000060234877,0.0038142565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.000059369024,0.000017218223,0.000035092155,0.0001539786,0.000034649],"domain_scores_gemma":[0.999488,0.00012279613,0.00010501368,0.00008206279,0.0001680912,0.000034087843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029400986,0.00037903409,0.00022825495,0.0003844084,0.00023109185,0.0005209126,0.00096513226,0.00046955934,0.0015041949],"category_scores_gemma":[0.00049776613,0.00020634985,0.00017052154,0.00026691012,0.0002546522,0.00043341142,0.00026124387,0.0003329945,0.00049597304],"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.000600384,0.00028960832,0.0022350233,0.0007015871,0.00017836638,0.0005369799,0.00041929114,0.16590136,0.40870023,0.024272073,0.003028178,0.39313695],"study_design_scores_gemma":[0.000100285135,0.0013251436,0.0011644978,0.00005632927,0.00006060239,0.00074867276,0.000051378604,0.6441637,0.33478492,0.0015986678,0.015877916,0.00006785554],"about_ca_topic_score_codex":0.0008652247,"about_ca_topic_score_gemma":0.0010824694,"teacher_disagreement_score":0.0015041949,"about_ca_system_score_codex":0.00040833204,"about_ca_system_score_gemma":0.0004710013,"threshold_uncertainty_score":0.005032003},"labels":[],"label_agreement":null},{"id":"W2136255046","doi":"10.1109/jsac.2007.070103","title":"Enhancing peer-to-peer systems through redundancy","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Ottawa","funders":"","keywords":"Computer science; Chord (peer-to-peer); Pastry; Redundancy (engineering); Distributed computing; Computer network; Routing table; Peer-to-peer; Fault tolerance; Network topology; Distributed hash table; Static routing; Routing (electronic design automation); Routing protocol","score_opus":0.04279279303619205,"score_gpt":0.33016500893815404,"score_spread":0.287372215901962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136255046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11977073,0.0024610115,0.8642887,0.000679813,0.00020441493,0.00023879686,0.000062917075,0.0039488208,0.008344823],"genre_scores_gemma":[0.8441009,0.0012164722,0.15134802,0.00011788451,0.00021979368,0.00011565448,0.0001070519,0.00013274883,0.0026415973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.0003577033,0.00008193054,0.00014889325,0.0006144011,0.000146865],"domain_scores_gemma":[0.9951068,0.0018191535,0.00046038962,0.0013860947,0.0010720454,0.00015555098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015741002,0.00083153497,0.00082450337,0.0009194529,0.00090264704,0.0010600995,0.002194024,0.00094060815,0.0016462478],"category_scores_gemma":[0.005916387,0.00040180667,0.0003418993,0.00069251034,0.00072894775,0.0036947676,0.002443732,0.0006463733,0.00092258665],"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.00073178124,0.00038858198,0.0031796237,0.0015038722,0.00020889385,0.001531477,0.0016248582,0.2503241,0.23075026,0.08456272,0.0085932575,0.41660053],"study_design_scores_gemma":[0.0002471219,0.001134341,0.0011875276,0.00008121843,0.00026193514,0.0022697055,0.00038425656,0.81617165,0.08743878,0.05192624,0.038753834,0.00014345377],"about_ca_topic_score_codex":0.00074851036,"about_ca_topic_score_gemma":0.0003833572,"teacher_disagreement_score":0.002194024,"about_ca_system_score_codex":0.0004016047,"about_ca_system_score_gemma":0.00062776846,"threshold_uncertainty_score":0.008324742},"labels":[],"label_agreement":null},{"id":"W2136302425","doi":"10.1109/jsac.2011.110402","title":"Simple Channel Sensing Order in Cognitive Radio Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":168,"is_retracted":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; Cognitive radio; Channel (broadcasting); Throughput; Computer network; Transmission (telecommunications); Network packet; Resource (disambiguation); Collision; Telecommunications; Wireless; Computer security","score_opus":0.05379817497475146,"score_gpt":0.28920315219406106,"score_spread":0.2354049772193096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136302425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15286547,0.0007433899,0.84237206,0.00019379181,0.00009386267,0.00011683515,0.0000638527,0.00045559,0.003095109],"genre_scores_gemma":[0.9176861,0.00031956303,0.08080378,0.00008022778,0.00006069393,0.000092533075,0.00003869057,0.000022633534,0.00089586753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.0005190052,0.00009018537,0.00017877234,0.00040281436,0.00017854778],"domain_scores_gemma":[0.9964612,0.0020478563,0.00043945631,0.0004906615,0.00036735568,0.00019337801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011384034,0.0006075351,0.0006483374,0.00047304155,0.00054857705,0.0006802438,0.0006022924,0.0005009641,0.00042068708],"category_scores_gemma":[0.0052813287,0.0004128558,0.00024077277,0.00040368314,0.0013335395,0.0012905311,0.00077726674,0.0007085682,0.00015619623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009400265,0.00025082458,0.003711215,0.00023633566,0.000044990706,0.00035838038,0.0003294786,0.7604651,0.041199647,0.083966866,0.0011234673,0.10737372],"study_design_scores_gemma":[0.000081971564,0.00040275467,0.001005097,0.000020723206,0.000022888546,0.0002554779,0.000054495118,0.9399361,0.0086180195,0.047973447,0.0015642385,0.000064913525],"about_ca_topic_score_codex":0.0013807485,"about_ca_topic_score_gemma":0.001687455,"teacher_disagreement_score":0.0013807485,"about_ca_system_score_codex":0.00056924013,"about_ca_system_score_gemma":0.0013925876,"threshold_uncertainty_score":0.006020546},"labels":[],"label_agreement":null},{"id":"W2139352451","doi":"10.1109/jsac.2008.080606","title":"Stochastic analysis of network coding in epidemic routing","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":124,"is_retracted":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; Linear network coding; Computer network; Correctness; Routing protocol; Coding (social sciences); Distributed computing; Wireless network; Wireless; Network packet; Algorithm; Telecommunications","score_opus":0.06992630000424571,"score_gpt":0.30718141671008253,"score_spread":0.23725511670583682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139352451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066158876,0.0012308835,0.9133627,0.0016734349,0.00014003241,0.00008486586,0.0001875543,0.00016523882,0.01699636],"genre_scores_gemma":[0.95625275,0.001784961,0.032506347,0.0002765178,0.00016424905,0.0002685165,0.00017106911,0.0000875124,0.0084879575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877685,0.0005872544,0.000038809907,0.000086877066,0.00031832966,0.0001918422],"domain_scores_gemma":[0.9914534,0.006403474,0.0007920189,0.00026306784,0.0008276467,0.00026032954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027132845,0.00072480435,0.0008516163,0.0012602727,0.0007168634,0.0013984812,0.0010084886,0.0013808609,0.0020016255],"category_scores_gemma":[0.014406305,0.0005380902,0.0007134981,0.0008909921,0.0024238739,0.0018858837,0.0013485972,0.0013751443,0.0002438912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002188085,0.000012873582,0.00037576904,0.000036076184,0.000016700871,0.00008068442,0.00008320626,0.5790813,0.00068873493,0.41652852,0.0008058615,0.0022683938],"study_design_scores_gemma":[0.0000055208607,0.0000053975446,0.00006815199,0.000007097571,0.000003468094,0.000012183476,0.000014974387,0.94228053,0.0000629409,0.057180792,0.00035165143,0.0000072764183],"about_ca_topic_score_codex":0.008863493,"about_ca_topic_score_gemma":0.0039757523,"teacher_disagreement_score":0.008863493,"about_ca_system_score_codex":0.0029052608,"about_ca_system_score_gemma":0.0015491144,"threshold_uncertainty_score":0.021079242},"labels":[],"label_agreement":null},{"id":"W2139805394","doi":"10.1109/jsac.2012.120915","title":"Moments Based Framework for Performance Analysis of One-Way/Two-Way CSI-Assisted AF Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Nakagami distribution; Fading; Rayleigh fading; Moment-generating function; Channel state information; Probability density function; Harmonic mean; Cumulative distribution function; Moment (physics); Channel (broadcasting); Algorithm; Function (biology); Telecommunications; Wireless; Mathematics; Statistics","score_opus":0.1109708704052715,"score_gpt":0.3576663757832263,"score_spread":0.24669550537795482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139805394","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.0048402995,0.00091660715,0.99066544,0.0000675081,0.000035650413,0.000023990315,0.00006249453,0.00012017084,0.0032679052],"genre_scores_gemma":[0.8154975,0.0055463947,0.17232819,0.00017483998,0.0004495732,0.00023152553,0.00026718914,0.00014923299,0.0053554866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995351,0.00014269911,0.000025442492,0.000053215263,0.00018665455,0.000056825043],"domain_scores_gemma":[0.9991353,0.00048724684,0.00013296345,0.00007181842,0.0001516233,0.000021123418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999904,0.0012347379,0.0007267988,0.0012338121,0.00026188826,0.00091274333,0.0009876338,0.0007037038,0.0016408992],"category_scores_gemma":[0.0028923138,0.00033452566,0.0008310533,0.0009584598,0.000731496,0.0011299918,0.0006525329,0.0011121851,0.00050575443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056035435,0.000040020645,0.00048607396,0.00017105047,0.000058501875,0.00033275736,0.00012274881,0.7562784,0.010527583,0.20696703,0.0015095634,0.02345032],"study_design_scores_gemma":[0.0000023718412,0.000038908023,0.00016039118,0.000012753466,0.000013803785,0.00010063353,0.000014899808,0.98512036,0.0009358922,0.012600294,0.0009862426,0.000013439972],"about_ca_topic_score_codex":0.0013611924,"about_ca_topic_score_gemma":0.00082085066,"teacher_disagreement_score":0.0016408992,"about_ca_system_score_codex":0.00084058533,"about_ca_system_score_gemma":0.00070790306,"threshold_uncertainty_score":0.006098926},"labels":[],"label_agreement":null},{"id":"W2140630780","doi":"10.1109/jsac.2004.836005","title":"On Designing Self-Tuning Controllers for AQM Routers Supporting TCP Flows Based on Pole Placement","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Controller (irrigation); Computer science; Full state feedback; Network packet; Queue; Bar (unit); PID controller; Network congestion; Physics; Computer network; Control engineering; Engineering; Control (management)","score_opus":0.023115070525951815,"score_gpt":0.2809371955891734,"score_spread":0.2578221250632216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140630780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015435216,0.00029394036,0.9812176,0.000065400585,0.000059171005,0.000047765934,0.000007523531,0.00068360136,0.0021897054],"genre_scores_gemma":[0.78404623,0.00058434025,0.21253945,0.0002110516,0.000112451526,0.00014318392,0.00003660326,0.00006238704,0.0022642664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000042313095,0.000015190138,0.000049131868,0.00008911161,0.000021899199],"domain_scores_gemma":[0.9995609,0.00016930545,0.000054233133,0.000040689072,0.00016108961,0.0000137232855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042405108,0.0005207731,0.00035684629,0.00035539508,0.00031878785,0.00044693396,0.0007039634,0.00048806713,0.0009890189],"category_scores_gemma":[0.0010470907,0.000211079,0.0002864895,0.00020202674,0.0005148128,0.00061449915,0.00041279517,0.00047634786,0.00033864548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026075475,0.00015462586,0.0014161228,0.00048508408,0.000072826864,0.00031172417,0.0005012542,0.40965393,0.17110239,0.03255897,0.0027110938,0.38077116],"study_design_scores_gemma":[0.000039413797,0.0002740819,0.00042127672,0.000021236736,0.000029858085,0.00012349457,0.000030222489,0.96396327,0.023566388,0.005585195,0.0059217783,0.00002381938],"about_ca_topic_score_codex":0.0008204604,"about_ca_topic_score_gemma":0.0006417142,"teacher_disagreement_score":0.0009890189,"about_ca_system_score_codex":0.00026808307,"about_ca_system_score_gemma":0.0003051365,"threshold_uncertainty_score":0.0033085942},"labels":[],"label_agreement":null},{"id":"W2140887445","doi":"10.1109/jsac.2012.120217","title":"Topology-Aware Modulation and Error-Correction Coding for Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Telecommunications Advancement Foundation; Division of Electrical, Communications and Cyber Systems; Division of Computer and Network Systems; Southeast University; University of Waterloo","keywords":"Computer science; Computer network; Telecommunications link; Network topology; Linear network coding; Topology (electrical circuits); Relay; Physical layer; Transmitter; Bit error rate; Throughput; Node (physics); Transmission (telecommunications); Channel (broadcasting); Electronic engineering; Wireless; Network packet; Telecommunications","score_opus":0.06914922741026319,"score_gpt":0.33854816698053186,"score_spread":0.26939893957026867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140887445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051902406,0.0015010354,0.9435569,0.00041614866,0.000048382903,0.000036667665,0.000028017423,0.000086137756,0.0024243183],"genre_scores_gemma":[0.92458194,0.0012495575,0.072971314,0.00007090441,0.000048546808,0.000082209066,0.00003450642,0.000017969362,0.0009431795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993125,0.00036297517,0.000021796108,0.000047443365,0.00019006399,0.000065219014],"domain_scores_gemma":[0.9983229,0.0010797387,0.0001812922,0.00018447917,0.00019923058,0.000032340457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422216,0.00045157055,0.00048043893,0.00044917926,0.000344772,0.00057030784,0.0009165783,0.0006571167,0.0005429946],"category_scores_gemma":[0.004681767,0.000205456,0.00029082442,0.000723978,0.00078358286,0.0012100195,0.000808632,0.0005454529,0.00012526989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007902896,0.000038312977,0.000654494,0.00011104354,0.00004364011,0.000112059606,0.00015661126,0.8741373,0.010698917,0.06375145,0.000741374,0.049475823],"study_design_scores_gemma":[0.000009834654,0.000051895633,0.00016450897,0.00000894455,0.000010576612,0.000048024274,0.000017864628,0.9800729,0.0019155798,0.016912142,0.0007774986,0.0000102684635],"about_ca_topic_score_codex":0.0010228822,"about_ca_topic_score_gemma":0.001262971,"teacher_disagreement_score":0.0012422216,"about_ca_system_score_codex":0.00066839176,"about_ca_system_score_gemma":0.0004970237,"threshold_uncertainty_score":0.0065695643},"labels":[],"label_agreement":null},{"id":"W2140965016","doi":"10.1109/jsac.2003.814862","title":"Joint connection level, packet level, and link layer resource allocation for variable bit rate multiclass services in cellular ds-cdma networks with qos constraints","year":2003,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Network packet; Link layer; Code division multiple access; Resource allocation; Distributed computing","score_opus":0.08357449577470405,"score_gpt":0.29596092433769516,"score_spread":0.21238642856299111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140965016","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.16590728,0.00057017145,0.8266761,0.00041395138,0.000032550855,0.00007893193,0.000072414885,0.00012916159,0.006119413],"genre_scores_gemma":[0.9677039,0.0002570272,0.029960116,0.000040466657,0.000015294308,0.000058107616,0.000032278404,0.00002748812,0.0019052527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.00019574404,0.0000134091815,0.000047764082,0.00010317839,0.00015524848],"domain_scores_gemma":[0.99932086,0.00046304506,0.00007136839,0.000029159706,0.00006931406,0.000046247733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093044766,0.00051346415,0.00067999907,0.000294069,0.00049164967,0.0012334125,0.00069032726,0.0005953188,0.001648954],"category_scores_gemma":[0.0023355647,0.00058348087,0.0003531439,0.0005765252,0.0007795462,0.0012407623,0.0007165485,0.0006185229,0.000148273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032530177,0.0000143951465,0.00022090519,0.000020329626,0.0000067808505,0.000042804135,0.000024723307,0.9825879,0.00075042684,0.011023935,0.00020277163,0.005072565],"study_design_scores_gemma":[0.0000035146415,0.00000722697,0.000049137117,0.0000013483454,0.0000026046885,0.000006940691,0.000009705754,0.9973635,0.00017864532,0.002296812,0.000078563804,0.0000019957433],"about_ca_topic_score_codex":0.01138449,"about_ca_topic_score_gemma":0.011684174,"teacher_disagreement_score":0.01138449,"about_ca_system_score_codex":0.002127118,"about_ca_system_score_gemma":0.0021873023,"threshold_uncertainty_score":0.022636473},"labels":[],"label_agreement":null},{"id":"W2141202063","doi":"10.1109/jsac.2004.826929","title":"Saturation Throughput Analysis of IEEE 802.11e Enhanced Distributed Coordination Function","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":358,"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; Distributed coordination function; Throughput; Quality of service; Computer network; Access control; IEEE 802; Bandwidth (computing); Wireless Multimedia Extensions; IEEE 802.11e-2005; Distributed computing; Wireless; IEEE 802.11; Wireless network; Telecommunications","score_opus":0.027806743339414765,"score_gpt":0.30501922292485434,"score_spread":0.2772124795854396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141202063","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.50949943,0.0016440465,0.462509,0.00090621895,0.000081509745,0.000091222355,0.00030682702,0.00088207086,0.024079708],"genre_scores_gemma":[0.99572396,0.00017547373,0.0031229695,0.00002864754,0.000010965665,0.000019838442,0.000039908853,0.000020827501,0.0008574643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999138,0.00023978404,0.000022623744,0.00009329985,0.00031308498,0.00019315537],"domain_scores_gemma":[0.9963337,0.0023635223,0.00025163995,0.00021750949,0.0007663274,0.00006721692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015454664,0.00055088906,0.00056362164,0.00083374814,0.00042681693,0.0005519423,0.00086687144,0.0006181364,0.0010246016],"category_scores_gemma":[0.00816033,0.00023550467,0.00036291443,0.0007195995,0.0009612317,0.001246844,0.0005023075,0.00070006936,0.00023455343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010134615,0.000032249704,0.0012737697,0.000035408364,0.000012082895,0.00010649932,0.0001125401,0.97117203,0.003404936,0.018203123,0.00043627174,0.0051097423],"study_design_scores_gemma":[0.0000019764284,0.000012018731,0.00020716569,0.0000028749243,0.0000020747984,0.000012649716,0.000008200785,0.99807656,0.0005677241,0.001009035,0.00009681421,0.0000029898474],"about_ca_topic_score_codex":0.010902261,"about_ca_topic_score_gemma":0.003142736,"teacher_disagreement_score":0.010902261,"about_ca_system_score_codex":0.0031701112,"about_ca_system_score_gemma":0.001127131,"threshold_uncertainty_score":0.023000896},"labels":[],"label_agreement":null},{"id":"W2141684199","doi":"10.1109/49.957316","title":"Link adaptation and power control for streaming services in EGPRS wireless networks","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Network Optimization","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 Victoria","funders":"","keywords":"Computer science; Throughput; Network packet; Power control; Error detection and correction; Packet radio; Frame (networking); Quality of service; Real-time computing; Computer network; Bit error rate; Link adaptation; Word error rate; Wireless; Power (physics); Algorithm; Fading; Telecommunications; Speech recognition","score_opus":0.014740480010574243,"score_gpt":0.250597028134996,"score_spread":0.23585654812442178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141684199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46684977,0.0005323392,0.52739227,0.00025526318,0.000025965055,0.00004473794,0.000026635305,0.00014713447,0.0047258832],"genre_scores_gemma":[0.98572415,0.00020965759,0.013320701,0.00002093442,0.00001396058,0.000016765705,0.000009426799,0.000007521019,0.0006767998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968016,0.00014833,0.000007707336,0.000026266105,0.00009288019,0.00004471229],"domain_scores_gemma":[0.9994199,0.000418233,0.000067924804,0.000020938269,0.00006220808,0.000010820086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485182,0.00044247424,0.00034019188,0.00018206204,0.00019281657,0.00030490645,0.0002886524,0.0003814673,0.00057816284],"category_scores_gemma":[0.0019074361,0.00014414643,0.00016379173,0.00028700728,0.00041341185,0.0005025678,0.00026447527,0.0003536747,0.00008481492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014457617,0.000054176733,0.0007723377,0.000042240794,0.000016796525,0.00013081901,0.000043703276,0.9572495,0.016834967,0.003787898,0.0001734307,0.020749595],"study_design_scores_gemma":[0.0000074226564,0.000102808415,0.00029737566,0.0000014228318,0.000008524185,0.000028078368,0.000011909794,0.9956898,0.0026738504,0.0010560241,0.00011994936,0.000002745087],"about_ca_topic_score_codex":0.001568268,"about_ca_topic_score_gemma":0.0014755854,"teacher_disagreement_score":0.001568268,"about_ca_system_score_codex":0.00038776844,"about_ca_system_score_gemma":0.00019715437,"threshold_uncertainty_score":0.0031182766},"labels":[],"label_agreement":null},{"id":"W2141692617","doi":"10.1109/jsac.2012.120706","title":"Optimized Day-Ahead Pricing for Smart Grids with Device-Specific Scheduling Flexibility","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":211,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Electricity; Purchasing; Smart grid; Scheduling (production processes); Dynamic pricing; Minification; Flexibility (engineering); Electricity pricing; Real-time computing; Mathematical optimization; Electricity market; Microeconomics; Economics; Operations management","score_opus":0.05627182290679464,"score_gpt":0.289451121055801,"score_spread":0.23317929814900637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141692617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20826523,0.00035629977,0.7858986,0.0004915649,0.00009040461,0.000080429614,0.0001620285,0.00081595016,0.0038395752],"genre_scores_gemma":[0.9461666,0.00005198129,0.052853223,0.000039704755,0.000013028778,0.000023909239,0.00006213211,0.00004535087,0.00074401376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995733,0.00016711642,0.000016996039,0.00007482973,0.00009021765,0.000077517674],"domain_scores_gemma":[0.99918824,0.000502413,0.000092157374,0.00006597556,0.00010231339,0.000048811566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147893,0.0004846185,0.00090117153,0.00031497562,0.00047325235,0.00092153676,0.0008759296,0.0006401513,0.001423969],"category_scores_gemma":[0.0031354812,0.00046534836,0.0002901415,0.00059124804,0.0004742608,0.0010863469,0.0004197901,0.0007444751,0.00020127113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045073608,0.00001793674,0.0003984211,0.000007680961,0.000007735691,0.000013507016,0.000015673926,0.98785967,0.00028570736,0.0024702048,0.00039349706,0.008484934],"study_design_scores_gemma":[0.0000034873167,0.0000036882404,0.000062823296,3.5346733e-7,0.000001052314,0.0000022877732,0.0000025850175,0.99867886,0.00006735381,0.001119814,0.00005615227,0.000001542803],"about_ca_topic_score_codex":0.011252415,"about_ca_topic_score_gemma":0.013030053,"teacher_disagreement_score":0.011252415,"about_ca_system_score_codex":0.0012740277,"about_ca_system_score_gemma":0.0012514432,"threshold_uncertainty_score":0.022373796},"labels":[],"label_agreement":null},{"id":"W2141946979","doi":"10.1109/jsac.2008.080404","title":"Achieving Single-User Performance in an FEC-Coded DS-CDMA System for Frequency Selective and Flat Fading Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Trellis (graph); Computer science; Algorithm; Convolutional code; Space–time trellis code; Fading; Rayleigh fading; Trellis modulation; Channel (broadcasting); Transmission (telecommunications); Tree (set theory); Code division multiple access; Decoding methods; Computer network; Telecommunications; Mathematics; Concatenated error correction code; Block code","score_opus":0.042592898392527216,"score_gpt":0.2810971730055904,"score_spread":0.23850427461306317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141946979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3340853,0.00030614706,0.65971786,0.00014567282,0.000028400367,0.000041814565,0.0000556879,0.00073150493,0.0048876205],"genre_scores_gemma":[0.87605923,0.000109859684,0.12205297,0.000035656423,0.000018432009,0.000023395005,0.00005474714,0.000027728101,0.0016180509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950016,0.000109256405,0.000024064115,0.000051551026,0.00022586458,0.00008900577],"domain_scores_gemma":[0.99898535,0.0005090388,0.00009096149,0.000110308574,0.00026993107,0.00003435807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059970474,0.00055555115,0.0003800097,0.00030533204,0.0004020563,0.0005366691,0.00035356026,0.0005933311,0.0010046235],"category_scores_gemma":[0.0024174615,0.00013866257,0.0002107721,0.00023142237,0.00029932254,0.000537596,0.00035310956,0.00034893776,0.00045102055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010606134,0.00015546971,0.0034169594,0.000257082,0.00012482268,0.0005022229,0.00049413316,0.37956867,0.318017,0.013589148,0.0010135173,0.2818003],"study_design_scores_gemma":[0.000031657695,0.00027374583,0.0010349451,0.000016596076,0.000032211105,0.0003588178,0.000031688625,0.8297106,0.16588831,0.0017607553,0.0008368845,0.000023848079],"about_ca_topic_score_codex":0.0012739319,"about_ca_topic_score_gemma":0.0024089736,"teacher_disagreement_score":0.0012739319,"about_ca_system_score_codex":0.0003724177,"about_ca_system_score_gemma":0.0006063259,"threshold_uncertainty_score":0.0033608675},"labels":[],"label_agreement":null},{"id":"W2141960788","doi":"10.1109/jsac-ocn.2007.027806","title":"Dynamic path-protected service provisioning in optical transport networks with a limited number of add/drop ports and transmitter tunability","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network 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":"University of Alberta","funders":"","keywords":"Computer network; Provisioning; Drop (telecommunication); Computer science; Transmitter; Blocking (statistics); Optical networking; Node (physics); Distributed computing; Telecommunications; Wavelength-division multiplexing; Wavelength; Materials science; Optoelectronics; Engineering","score_opus":0.009164538434716141,"score_gpt":0.252352634480164,"score_spread":0.24318809604544783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141960788","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.6642655,0.00035510643,0.32996923,0.0003124201,0.000028040206,0.00004645136,0.000069593836,0.0001545723,0.004799079],"genre_scores_gemma":[0.9886418,0.00012594984,0.0104375025,0.000015055494,0.00001054376,0.000019634792,0.000014839491,0.000009578036,0.000725211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963975,0.00010277788,0.000008965238,0.000046585857,0.00009830657,0.00010364682],"domain_scores_gemma":[0.999281,0.00038754637,0.00015672394,0.000056656507,0.00008565547,0.000032395954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900834,0.0006041532,0.0004542681,0.0003871071,0.0006577311,0.0007230038,0.00060949486,0.00052937074,0.0006627751],"category_scores_gemma":[0.0021533587,0.00040527174,0.0003675195,0.0005716831,0.00085859664,0.0012701234,0.0005193863,0.00048079147,0.00007139014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034549277,0.000020464266,0.0003358302,0.000014323003,0.0000061345972,0.000078394376,0.000021003956,0.98886245,0.0035496964,0.004007034,0.00005283134,0.0030172463],"study_design_scores_gemma":[0.000003780422,0.000021129363,0.000084782165,0.0000016762041,0.0000041260555,0.000016139578,0.000008918989,0.99784803,0.00089923677,0.001042658,0.00006690289,0.0000025889385],"about_ca_topic_score_codex":0.006155906,"about_ca_topic_score_gemma":0.0041897814,"teacher_disagreement_score":0.006155906,"about_ca_system_score_codex":0.0012410247,"about_ca_system_score_gemma":0.0010051846,"threshold_uncertainty_score":0.012240171},"labels":[],"label_agreement":null},{"id":"W2142717204","doi":"10.1109/jsac.2014.2328171","title":"Min Flow Rate Maximization for Software Defined Radio Access Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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":"Huawei Technologies (Canada)","funders":"Huawei Technologies","keywords":"Computer science; Backhaul (telecommunications); Computer network; Radio access network; Software-defined networking; Wireless network; Base station; Cloud computing; Access network; Wireless; Distributed computing; Telecommunications","score_opus":0.024414862608522325,"score_gpt":0.27329429164677055,"score_spread":0.24887942903824822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142717204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010446256,0.0011019659,0.9839426,0.00043927078,0.00007223943,0.00008253166,0.00009440642,0.000087453416,0.0037332606],"genre_scores_gemma":[0.65166116,0.0030545362,0.33474383,0.00041782204,0.00029373533,0.0006315592,0.000401682,0.00018584784,0.008609784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893254,0.00059682294,0.000032378295,0.00014935805,0.00015497537,0.00013398538],"domain_scores_gemma":[0.9979473,0.001466976,0.00018569789,0.00007077044,0.00024315479,0.00008614565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002818931,0.0021975636,0.0015290225,0.00081154413,0.00046715388,0.0017587242,0.0012542503,0.0014258309,0.0022499731],"category_scores_gemma":[0.0051619858,0.00076820806,0.00070751325,0.0013452985,0.0014258336,0.001726367,0.0013835719,0.0014621635,0.00043791407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070988266,0.000048131744,0.0002678852,0.000119444485,0.000037713955,0.00005357689,0.00004922018,0.95215213,0.00077476393,0.03230296,0.0013156988,0.012807438],"study_design_scores_gemma":[0.0000073841375,0.000015353287,0.000041790125,0.000007398284,0.0000040554023,0.000008859578,0.0000073143515,0.9890304,0.0001683702,0.010307607,0.00039803446,0.000003274064],"about_ca_topic_score_codex":0.0030661647,"about_ca_topic_score_gemma":0.0021363269,"teacher_disagreement_score":0.0030661647,"about_ca_system_score_codex":0.0019593812,"about_ca_system_score_gemma":0.0015254123,"threshold_uncertainty_score":0.014908075},"labels":[],"label_agreement":null},{"id":"W2142966661","doi":"10.1109/jsac.2005.858874","title":"Capacity of future WCDMA networks supporting multimedia services","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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":"McGill University","funders":"","keywords":"Computer science; Computer network; Quality of service; Telecommunications link; Dimensioning; Session (web analytics); Code division multiple access; Data as a service; Channel (broadcasting); Multimedia; Service (business); World Wide Web","score_opus":0.0326628706888007,"score_gpt":0.3179946046316249,"score_spread":0.2853317339428242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142966661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38158935,0.007422785,0.5485488,0.002551923,0.00024721786,0.000086284424,0.002363258,0.0010315112,0.056158774],"genre_scores_gemma":[0.9837114,0.0020138922,0.008138351,0.00007895218,0.000084754145,0.000078160985,0.0005705274,0.000057785295,0.005266085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994338,0.00008771653,0.000015282818,0.000055068514,0.00026017203,0.0001478791],"domain_scores_gemma":[0.99886024,0.00054323423,0.000104219725,0.0000802902,0.00037166802,0.00004037249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007662347,0.0003599241,0.0003598253,0.0009152779,0.00050294807,0.001127748,0.0007746613,0.00078090455,0.002668487],"category_scores_gemma":[0.0040184283,0.0002469337,0.00023988074,0.00086681766,0.00041983253,0.0014900239,0.00043827656,0.0006404137,0.0007093685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084542466,0.000023868435,0.0014181685,0.00010994978,0.000025877456,0.00025155875,0.00016281912,0.86209935,0.0102141155,0.09596941,0.002631444,0.027008902],"study_design_scores_gemma":[0.000004045206,0.000017832292,0.000711493,0.000029757317,0.000011000855,0.0001475316,0.000033405748,0.97679806,0.002562807,0.01524981,0.0044202814,0.000013970402],"about_ca_topic_score_codex":0.0077786706,"about_ca_topic_score_gemma":0.0041965013,"teacher_disagreement_score":0.0077786706,"about_ca_system_score_codex":0.0016790952,"about_ca_system_score_gemma":0.0010059088,"threshold_uncertainty_score":0.015466809},"labels":[],"label_agreement":null},{"id":"W2143535483","doi":"10.1109/jsac.2008.080117","title":"Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks: Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":525,"is_retracted":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":"Nash equilibrium; Computer science; Collusion; Cognitive radio; Oligopoly; Service provider; Profit (economics); Quality of service; Price of stability; Dynamic pricing; Best response; Profit maximization; Game theory; Computer network; Sequential game; Microeconomics; Mathematical optimization; Business; Service (business); Economics; Telecommunications; Wireless; Cournot competition; Mathematics","score_opus":0.02722329959451862,"score_gpt":0.28518982667317366,"score_spread":0.25796652707865503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143535483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21112002,0.001036676,0.76889974,0.0016469865,0.000114340524,0.00013406368,0.00005267969,0.00009254784,0.016902884],"genre_scores_gemma":[0.9824918,0.0004013215,0.015263099,0.00010499963,0.00006263234,0.00007719427,0.000014169665,0.000020929867,0.0015638038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976634,0.0011593924,0.000051129817,0.00022302022,0.00046928783,0.00043380863],"domain_scores_gemma":[0.99290025,0.005521562,0.0007338477,0.00017460405,0.00041673848,0.00025299352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027148395,0.0012904782,0.0014589778,0.00089730305,0.0012597811,0.002874862,0.0019820197,0.0021305224,0.0012137324],"category_scores_gemma":[0.01043094,0.000660068,0.0011152268,0.0011690853,0.0037154038,0.0030562603,0.0021038875,0.0014055542,0.00012709417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000899346,0.00009539339,0.00087100494,0.00009330934,0.000064497784,0.0005395821,0.00027234748,0.79958385,0.0016074104,0.18958691,0.00090505864,0.006290676],"study_design_scores_gemma":[0.0000134039055,0.000022524775,0.00010487032,0.000006243015,0.000013489285,0.000050051283,0.000045984554,0.96429205,0.00015428897,0.03504616,0.00023797904,0.000012914478],"about_ca_topic_score_codex":0.006941307,"about_ca_topic_score_gemma":0.004115304,"teacher_disagreement_score":0.006941307,"about_ca_system_score_codex":0.0030660743,"about_ca_system_score_gemma":0.0019724662,"threshold_uncertainty_score":0.022246063},"labels":[],"label_agreement":null},{"id":"W2144211846","doi":"10.1109/jsac.2011.110118","title":"Time and Location-Critical Emergency Message Dissemination for Vehicular Ad-Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Dissemination; Vehicular ad hoc network; Wireless ad hoc network; Computer network; Scalability; Coding (social sciences); Information Dissemination; Distributed computing; Telecommunications; Wireless","score_opus":0.0192923219771552,"score_gpt":0.27230814944303405,"score_spread":0.25301582746587886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144211846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031215252,0.0019934832,0.96230245,0.00042719193,0.00012560895,0.00008803892,0.000027469325,0.00016601519,0.0036545189],"genre_scores_gemma":[0.93540406,0.001802838,0.059929896,0.000078928315,0.000104854415,0.000121469224,0.000056707144,0.000014809219,0.0024863887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965453,0.00013428504,0.00001702711,0.000029553981,0.0001352798,0.000029387149],"domain_scores_gemma":[0.9990865,0.0005602408,0.00009894242,0.000059330167,0.0001645199,0.00003044932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071288785,0.00032666925,0.00031908278,0.0003936814,0.0003515207,0.0004225818,0.00052993966,0.00040282472,0.0007245336],"category_scores_gemma":[0.0029699153,0.0001232175,0.00020406766,0.0003623133,0.00048539243,0.00070491806,0.00058602536,0.00042601026,0.00011168897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014627563,0.000042974578,0.00062165636,0.00027514197,0.000030306313,0.00026214737,0.00020645018,0.7964574,0.02119139,0.075992756,0.0022656664,0.102507785],"study_design_scores_gemma":[0.000011445721,0.00008689075,0.00013360128,0.00000999408,0.000011807391,0.00006773438,0.000034633267,0.98804885,0.0016957602,0.0077523626,0.0021380282,0.000008853504],"about_ca_topic_score_codex":0.0015427939,"about_ca_topic_score_gemma":0.0014585743,"teacher_disagreement_score":0.0015427939,"about_ca_system_score_codex":0.00059288484,"about_ca_system_score_gemma":0.0007409744,"threshold_uncertainty_score":0.004301727},"labels":[],"label_agreement":null},{"id":"W2144295065","doi":"10.1109/jsac.2012.120919","title":"Two-Way Amplify-and-Forward Multiple-Input Multiple-Output Relay Networks with Antenna Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Relay; Computer science; Fading; Diversity gain; Antenna (radio); Cooperative diversity; Relay channel; MIMO; Selection (genetic algorithm); Computer network; Channel state information; Telecommunications; Channel (broadcasting); Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Artificial intelligence; Power (physics)","score_opus":0.04527269415622559,"score_gpt":0.29719683974577427,"score_spread":0.2519241455895487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144295065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015041837,0.00064159033,0.98021233,0.00012223335,0.000037730333,0.00003350059,0.00003775884,0.000119383476,0.0037536442],"genre_scores_gemma":[0.8493443,0.0016386322,0.14319521,0.00009817804,0.000092538,0.00016765212,0.00006616705,0.000026478621,0.0053707804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.00034208948,0.000028027604,0.00010175704,0.00018109818,0.000086672044],"domain_scores_gemma":[0.9992617,0.00039496066,0.00011734965,0.00007011279,0.0001379741,0.000018011777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432331,0.001312307,0.0006826304,0.00032266777,0.00032092916,0.001090352,0.0010632328,0.00082970114,0.0012380388],"category_scores_gemma":[0.0011600604,0.00038981525,0.0006761924,0.000556643,0.0005719472,0.0011487752,0.0005005596,0.0005768696,0.00043453003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016770758,0.00006209485,0.0010024172,0.0001800091,0.00011179599,0.00040843344,0.0001755726,0.8321994,0.017478753,0.085772015,0.0016394509,0.060802348],"study_design_scores_gemma":[0.000008882936,0.00007247646,0.00014322146,0.000008478994,0.000027283664,0.0001713679,0.0000182934,0.9885719,0.002120524,0.007729904,0.0011145545,0.000013104686],"about_ca_topic_score_codex":0.00076253834,"about_ca_topic_score_gemma":0.0013304923,"teacher_disagreement_score":0.001312307,"about_ca_system_score_codex":0.0008589677,"about_ca_system_score_gemma":0.0003353618,"threshold_uncertainty_score":0.0062322617},"labels":[],"label_agreement":null},{"id":"W2144776482","doi":"10.1109/jsac.2013.sup2.1213008","title":"Dynamic Service Placement in Geographically Distributed Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":158,"is_retracted":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; Service provider; Nash equilibrium; Cloud computing; Service (business); Context (archaeology); Key (lock); Service delivery framework; Game theory; Distributed computing; Operations research; Computer security; Microeconomics; Business; Economics","score_opus":0.014706337987576212,"score_gpt":0.26001886520386935,"score_spread":0.24531252721629315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144776482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29400247,0.00066928513,0.6961138,0.0012663446,0.00012026481,0.00020510907,0.00012422142,0.0004949705,0.007003554],"genre_scores_gemma":[0.97372663,0.00013644581,0.025093835,0.00005065887,0.000023689006,0.000050017134,0.000025324303,0.000026278118,0.000867261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998522,0.0005900638,0.00005116631,0.00025625617,0.0002697197,0.00031078793],"domain_scores_gemma":[0.9982095,0.00086031127,0.00031299572,0.00015681962,0.00018291161,0.00027753567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416485,0.0008707855,0.0009164251,0.0007696896,0.00149451,0.0016340254,0.001805713,0.0019460142,0.0013400932],"category_scores_gemma":[0.0042818035,0.00077121565,0.00054513424,0.0011241249,0.0015072979,0.0018668026,0.0019026343,0.0008755057,0.00018778973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000752652,0.000040152347,0.0005264118,0.000021190544,0.000015946174,0.00015083727,0.000050595132,0.9755986,0.0014256309,0.016397811,0.00041569257,0.0052818824],"study_design_scores_gemma":[0.000020173024,0.00003504896,0.00019901425,0.0000035749765,0.0000062071813,0.00003105666,0.000073633586,0.98939997,0.0002911479,0.009566273,0.0003657276,0.000008120241],"about_ca_topic_score_codex":0.009816512,"about_ca_topic_score_gemma":0.0070605716,"teacher_disagreement_score":0.009816512,"about_ca_system_score_codex":0.0028440088,"about_ca_system_score_gemma":0.0017038642,"threshold_uncertainty_score":0.02063483},"labels":[],"label_agreement":null},{"id":"W2146432102","doi":"10.1109/jsac.2005.863867","title":"A position-based QoS routing scheme for UWB mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Ultra-Wideband Communications Technology","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 Waterloo","funders":"","keywords":"Computer network; Computer science; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Quality of service; Mobile ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Bandwidth (computing); Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Reservation; Geographic routing; Distributed computing; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications","score_opus":0.011775408691204598,"score_gpt":0.2526607263988855,"score_spread":0.24088531770768087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146432102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042934716,0.0014406971,0.94812745,0.0005390633,0.0005656173,0.000150768,0.0000765294,0.0013718795,0.004793282],"genre_scores_gemma":[0.56855154,0.0011714543,0.4212748,0.0003240596,0.00030887412,0.0001447478,0.0002697017,0.00009394196,0.0078609595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995616,0.00009441103,0.00003964795,0.00006946664,0.00018805533,0.000046820536],"domain_scores_gemma":[0.99945384,0.000092102084,0.00007733202,0.00010995794,0.0002143855,0.000052464875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006052269,0.00047115795,0.00037724248,0.00049982156,0.0008224855,0.0006633233,0.0009846156,0.0005759746,0.0011382109],"category_scores_gemma":[0.0013177571,0.00017412029,0.00028421186,0.00039041214,0.00046233597,0.00096645637,0.00072763563,0.0007331343,0.00054128806],"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.00051675003,0.00019461226,0.000901027,0.00033984415,0.000072432726,0.00051677146,0.00045734624,0.063926786,0.2863593,0.09293254,0.0060132975,0.5477693],"study_design_scores_gemma":[0.00019327308,0.0014477301,0.001289913,0.00007436703,0.00018265254,0.002105716,0.00017358478,0.75583553,0.13938774,0.02203538,0.07704924,0.00022486215],"about_ca_topic_score_codex":0.0005505473,"about_ca_topic_score_gemma":0.0007819389,"teacher_disagreement_score":0.0011382109,"about_ca_system_score_codex":0.00057374185,"about_ca_system_score_gemma":0.0004036248,"threshold_uncertainty_score":0.0041627884},"labels":[],"label_agreement":null},{"id":"W2146439054","doi":"10.1109/jsac.2010.100905","title":"Distributed target tracking using signal strength measurements by a wireless sensor network","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Blackberry (Canada); University of British Columbia","funders":"","keywords":"Computer science; Wireless sensor network; Scalability; Tracking (education); Real-time computing; Estimator; Wireless network; Wireless; Computer network; Telecommunications","score_opus":0.03495093487898,"score_gpt":0.27031041445997994,"score_spread":0.23535947958099995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146439054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01793761,0.00013642877,0.98063385,0.00007481264,0.000027137623,0.00001708191,0.000017162984,0.00024372787,0.0009121688],"genre_scores_gemma":[0.73680854,0.00055826723,0.26028025,0.00008190332,0.00008921267,0.000090069254,0.00012956474,0.000030532825,0.0019316307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.0000931011,0.000017727998,0.00012791762,0.000144597,0.000023251514],"domain_scores_gemma":[0.99942076,0.0002299644,0.00009284263,0.00014888583,0.00008423199,0.000023346898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005388968,0.00048364664,0.00056437554,0.00046734564,0.00030840392,0.0006715984,0.0009560816,0.00070811156,0.0004491401],"category_scores_gemma":[0.0023880273,0.00040372202,0.0004190303,0.00064985675,0.0004654375,0.0017101715,0.00095636357,0.00077234645,0.0002566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019569683,0.00010187282,0.0032436985,0.000098307064,0.00011140265,0.00013090987,0.00011307393,0.70308113,0.03695756,0.012462391,0.00093943754,0.24256454],"study_design_scores_gemma":[0.0000154769,0.0000742314,0.0007645866,0.000006589586,0.000019918916,0.000054964592,0.000011097484,0.9895592,0.0038278108,0.0045974837,0.0010580163,0.0000106866855],"about_ca_topic_score_codex":0.0015621411,"about_ca_topic_score_gemma":0.0017194378,"teacher_disagreement_score":0.0015621411,"about_ca_system_score_codex":0.00039011898,"about_ca_system_score_gemma":0.00063569815,"threshold_uncertainty_score":0.0031060576},"labels":[],"label_agreement":null},{"id":"W2146745654","doi":"10.1109/jsac.2006.881628","title":"Fair Allocation of Subcarrier and Power in an OFDMA Wireless Mesh Network","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":118,"is_retracted":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":"Wireless mesh network; Computer science; Subcarrier; Mesh networking; Scheduling (production processes); Switched mesh; Orthogonal frequency-division multiple access; Shared mesh; Computer network; Integer programming; Mathematical optimization; Distributed computing; Wireless; Wireless network; Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Mathematics","score_opus":0.010715356699834356,"score_gpt":0.24599905267313998,"score_spread":0.23528369597330562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146745654","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.040086966,0.00021377581,0.9571468,0.00013442231,0.000058636506,0.000038169037,0.000029382083,0.000103895894,0.0021878015],"genre_scores_gemma":[0.8444113,0.0002490514,0.15241514,0.000052102598,0.000075609416,0.0000993019,0.00002942778,0.000030425716,0.0026377724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.00038188935,0.000042299624,0.0001594036,0.0002953746,0.00015734287],"domain_scores_gemma":[0.9990251,0.0005736176,0.00010501811,0.00013585649,0.00011159328,0.000048795588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019493131,0.00043708205,0.0005951824,0.0004751393,0.00097567483,0.00088299153,0.0010962229,0.0006350033,0.00079174765],"category_scores_gemma":[0.0038558287,0.00021689037,0.00026985374,0.0005407773,0.0011566282,0.001994928,0.0009671864,0.0004391889,0.00016318502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027760243,0.000097045115,0.001190796,0.000065641594,0.000047098776,0.00022838502,0.00019468542,0.7631441,0.012544322,0.11623796,0.0015052246,0.10446707],"study_design_scores_gemma":[0.000016376725,0.00003909869,0.0001508586,0.0000036619278,0.000010932143,0.000031955824,0.000023294875,0.9754556,0.0015428906,0.021178426,0.0015367824,0.000010016259],"about_ca_topic_score_codex":0.0025540178,"about_ca_topic_score_gemma":0.0030055258,"teacher_disagreement_score":0.0025540178,"about_ca_system_score_codex":0.0011410557,"about_ca_system_score_gemma":0.0010097177,"threshold_uncertainty_score":0.010309041},"labels":[],"label_agreement":null},{"id":"W2147730843","doi":"10.1109/jsac.2007.070209","title":"Joint optimization of relay strategies and resource allocations in cooperative cellular networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":503,"is_retracted":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; Relay; Computer network; Wireless network; Relay channel; Orthogonal frequency-division multiple access; Node (physics); Resource allocation; Bandwidth (computing); Link Access Procedure for Frame Relay; Physical layer; Wireless; Channel (broadcasting); Telecommunications; Orthogonal frequency-division multiplexing; Power (physics); Engineering","score_opus":0.042511453987379835,"score_gpt":0.2898647024568767,"score_spread":0.24735324846949686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147730843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07674948,0.00072589674,0.91726834,0.00024740415,0.000022707572,0.00004928599,0.000053418175,0.00012837509,0.0047549754],"genre_scores_gemma":[0.96858066,0.00036275954,0.028648756,0.00004466397,0.000017454518,0.00009887358,0.000030856678,0.000026188996,0.0021897268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897134,0.00055274833,0.000027638602,0.00013881753,0.00015356265,0.0001558034],"domain_scores_gemma":[0.9988403,0.0007459843,0.00013846139,0.00006718307,0.00015354397,0.000054466676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015856337,0.0011723974,0.0009872937,0.0005533179,0.00036298676,0.001205053,0.0010563753,0.0012002937,0.00074824115],"category_scores_gemma":[0.0036301888,0.00051596336,0.00032025584,0.0010601388,0.0010568006,0.0011033787,0.00097225676,0.00043458826,0.0002366224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043977772,0.000021530304,0.00019218156,0.000022545324,0.00002443198,0.00006781388,0.000040752384,0.9799009,0.0011353196,0.009286179,0.00021925544,0.009045059],"study_design_scores_gemma":[0.000016249523,0.000043408203,0.0000710186,0.0000037034918,0.000011656894,0.000019466373,0.000020082443,0.99077386,0.00051716354,0.0082297195,0.00028787152,0.000005774148],"about_ca_topic_score_codex":0.0022277175,"about_ca_topic_score_gemma":0.0019011036,"teacher_disagreement_score":0.0022277175,"about_ca_system_score_codex":0.0010585443,"about_ca_system_score_gemma":0.00067629095,"threshold_uncertainty_score":0.008385718},"labels":[],"label_agreement":null},{"id":"W2148656332","doi":"10.1109/jsac.2005.854119","title":"Conflict classification and analysis of distributed firewall policies","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":288,"is_retracted":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":"Firewall (physics); Computer science; Application firewall; Context-based access control; DMZ; Security policy; Computer security; Network security; Distributed computing; Stateful firewall; Entropy (arrow of time)","score_opus":0.04643447313465448,"score_gpt":0.31568186122946795,"score_spread":0.26924738809481347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148656332","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.5335922,0.00036788196,0.45862946,0.00049425714,0.00007253427,0.0002303595,0.0006241314,0.001729316,0.0042598085],"genre_scores_gemma":[0.8991303,0.00005541197,0.099312544,0.000046100962,0.000027519114,0.00008326608,0.0006906692,0.000046238518,0.0006079188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952282,0.001278034,0.00043859807,0.00070894643,0.0019682406,0.0003780521],"domain_scores_gemma":[0.9775963,0.013685286,0.0022242537,0.0024893314,0.0034937437,0.00051119184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041493773,0.0004317286,0.00074068597,0.0029248612,0.0008899333,0.0016823602,0.0014638535,0.00079021644,0.0014264196],"category_scores_gemma":[0.020962773,0.0002381068,0.0005472059,0.0015785543,0.000699024,0.0017940352,0.0007971206,0.0009966185,0.00021760272],"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.001570673,0.00077169976,0.21370335,0.00027179756,0.00031362078,0.0009992196,0.0009497964,0.21411343,0.014818593,0.04663569,0.005396324,0.50045586],"study_design_scores_gemma":[0.000024503692,0.00004100044,0.0065503526,0.000011603449,0.00002564986,0.00019108545,0.00012070081,0.972639,0.006245898,0.013166005,0.0009696792,0.00001443146],"about_ca_topic_score_codex":0.002858972,"about_ca_topic_score_gemma":0.002052871,"teacher_disagreement_score":0.0041493773,"about_ca_system_score_codex":0.001179128,"about_ca_system_score_gemma":0.0012765396,"threshold_uncertainty_score":0.021944284},"labels":[],"label_agreement":null},{"id":"W2148823080","doi":"10.1109/49.848259","title":"Zerotree pattern coding of motion picture residues for error-resilient transmission of video sequences","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Compression 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":"Memorial University of Newfoundland","funders":"","keywords":"Quadtree; Computer science; Artificial intelligence; Coding (social sciences); Computer vision; Pixel; Data compression; Context-adaptive binary arithmetic coding; Coding tree unit; Wavelet; Sub-band coding; Pattern recognition (psychology); Wavelet transform; Algorithm; Decoding methods; Mathematics; Statistics","score_opus":0.04133638367224079,"score_gpt":0.3327204557964102,"score_spread":0.2913840721241694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148823080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06976413,0.0014923355,0.9225752,0.0002475413,0.00018600021,0.000110449044,0.0001429944,0.0007001497,0.004781263],"genre_scores_gemma":[0.36507767,0.0016342045,0.6255193,0.00016269868,0.00013585183,0.00008717383,0.00048778544,0.00015793348,0.0067373025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998616,0.000024481682,0.000009583142,0.000013479155,0.000081019134,0.000009822008],"domain_scores_gemma":[0.99974734,0.00007711983,0.000028165003,0.00006452625,0.000070492555,0.000012443934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016205353,0.00022550921,0.00018764152,0.00036123965,0.00016980356,0.00027119907,0.00036985026,0.0002449079,0.0018860032],"category_scores_gemma":[0.0008386133,0.00010096228,0.00014473357,0.00044088464,0.00025534802,0.0005718523,0.00028911952,0.00035735915,0.00062029314],"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.0002846906,0.00006477897,0.00047156567,0.00034565575,0.000020322253,0.00041819122,0.00011834487,0.015532822,0.43666232,0.041101813,0.003321946,0.50165755],"study_design_scores_gemma":[0.00011729589,0.0008237106,0.0020913573,0.00011027087,0.00007050749,0.0028908993,0.00006598523,0.40075353,0.49447727,0.030778924,0.0677607,0.0000594578],"about_ca_topic_score_codex":0.0002620199,"about_ca_topic_score_gemma":0.0007286963,"teacher_disagreement_score":0.0018860032,"about_ca_system_score_codex":0.00015253328,"about_ca_system_score_gemma":0.0003220193,"threshold_uncertainty_score":0.0063093305},"labels":[],"label_agreement":null},{"id":"W2149262387","doi":"10.1109/jsac.2005.851791","title":"Optimal resource allocation and fairness control in all-optical WDM networks","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network 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":"Carleton University","funders":"","keywords":"Computer science; Resource allocation; Heuristic; Markov decision process; Mathematical optimization; Max-min fairness; Markov process; Wavelength-division multiplexing; Network topology; Multiplexing; Resource management (computing); Distributed computing; Computer network; Mathematics; Wavelength; Telecommunications","score_opus":0.017608666734662295,"score_gpt":0.26551459147723416,"score_spread":0.24790592474257186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149262387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101710975,0.00078160624,0.8939144,0.00039910147,0.00006590713,0.000060805323,0.000037123817,0.00012683654,0.0029032317],"genre_scores_gemma":[0.9592854,0.00029419956,0.039002277,0.000049984097,0.00004211207,0.000048220387,0.000017213475,0.000024821657,0.0012359355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843687,0.0007770181,0.00004251104,0.00017245417,0.00031197918,0.00025920107],"domain_scores_gemma":[0.99688727,0.0022922903,0.0003293229,0.000095517426,0.00026400108,0.00013154531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033649474,0.0006603612,0.0009768724,0.00051450497,0.000740711,0.0014332435,0.0010874642,0.00089409883,0.00065425533],"category_scores_gemma":[0.007185268,0.00053063495,0.00032261887,0.00053033716,0.0017629275,0.001791066,0.00096927397,0.0007334642,0.00008451249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007943712,0.00002913638,0.00024724504,0.000026001373,0.000016012795,0.00003217506,0.000036872636,0.967862,0.0007494926,0.021687793,0.00014113686,0.009092702],"study_design_scores_gemma":[0.000013036701,0.000013562851,0.000056764395,0.0000022632794,0.000003381229,0.000004976967,0.000006941372,0.98693085,0.00035851626,0.012461721,0.00014464874,0.0000033797908],"about_ca_topic_score_codex":0.0067568203,"about_ca_topic_score_gemma":0.0036741514,"teacher_disagreement_score":0.0067568203,"about_ca_system_score_codex":0.0024475732,"about_ca_system_score_gemma":0.0023931318,"threshold_uncertainty_score":0.017795801},"labels":[],"label_agreement":null},{"id":"W2149988228","doi":"10.1109/jsac.2007.070112","title":"Efficient search and scheduling in P2P-based media-on-demand streaming service","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Waterloo","funders":"Hong Kong University of Science and Technology","keywords":"Computer science; Scheduling (production processes); Exploit; Computer network; Quality of service; Asynchronous communication; Coding (social sciences); Linear network coding; Overlay network; Distributed computing; The Internet; Network packet; World Wide Web","score_opus":0.04139729300686496,"score_gpt":0.3147303436373587,"score_spread":0.27333305063049373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149988228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29046854,0.0009775368,0.7031282,0.0005648072,0.00006939628,0.00015161098,0.00010583466,0.00079251046,0.0037415128],"genre_scores_gemma":[0.9430894,0.00022267966,0.05560343,0.000032365315,0.00002500354,0.000066112436,0.00005101986,0.000029990657,0.0008800381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.0001891962,0.000021613057,0.00006492,0.00013440287,0.000059564234],"domain_scores_gemma":[0.99921346,0.0005125937,0.000062643,0.000043325537,0.00009880214,0.000069229915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084449875,0.00032862654,0.0007662136,0.0004191937,0.0006569107,0.00061062607,0.0009446317,0.00063573755,0.00046204892],"category_scores_gemma":[0.0023235672,0.0002798356,0.00018493457,0.0007011079,0.00044868136,0.000936807,0.0005296559,0.00038341293,0.00009924363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043272224,0.00013650085,0.0011783128,0.00015088158,0.00003687944,0.0003969357,0.0002070874,0.8911971,0.020268697,0.020743271,0.0023126407,0.06293905],"study_design_scores_gemma":[0.000014867499,0.000017150567,0.00007210708,8.439108e-7,0.0000031314958,0.000021800726,0.000016197248,0.99697864,0.0010526346,0.0015902275,0.00022978193,0.0000026476205],"about_ca_topic_score_codex":0.007591565,"about_ca_topic_score_gemma":0.0058773756,"teacher_disagreement_score":0.007591565,"about_ca_system_score_codex":0.0007645415,"about_ca_system_score_gemma":0.0009812354,"threshold_uncertainty_score":0.015094757},"labels":[],"label_agreement":null},{"id":"W2150943066","doi":"10.1109/jsac.2002.807342","title":"Performance analysis of ad hoc wireless LANs for real-time traffic","year":2003,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Network packet; Wireless; Throughput; Base station; Wireless lan; Distributed computing; Real-time computing; Telecommunications","score_opus":0.031348771216967435,"score_gpt":0.3017720357285887,"score_spread":0.27042326451162124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150943066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38005117,0.005890715,0.59365493,0.00086870725,0.00011584664,0.000112475325,0.00017264999,0.0006239929,0.018509444],"genre_scores_gemma":[0.9836073,0.001952029,0.011281297,0.000041356445,0.000088841836,0.00006418864,0.00008807449,0.00003882419,0.0028380873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.00025291427,0.000019122046,0.000057126876,0.0002942445,0.00009506779],"domain_scores_gemma":[0.99827397,0.0011733248,0.00014725192,0.00009731671,0.0002604934,0.000047725705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170144,0.00074903877,0.000353035,0.00088355923,0.0003330666,0.00079098035,0.0005431799,0.0004125141,0.0012847412],"category_scores_gemma":[0.0041953693,0.0002354528,0.0002371317,0.0005853483,0.00048526333,0.00091610546,0.00032533842,0.00043133393,0.00032736824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013886068,0.00008398096,0.0023266887,0.00012019098,0.000047422825,0.0001316689,0.00010217232,0.92841345,0.005347298,0.037455097,0.0010138422,0.02481934],"study_design_scores_gemma":[0.00000436371,0.00007208075,0.00061834446,0.000006686318,0.000010166523,0.00004024943,0.000020190239,0.99271023,0.0006644603,0.0051787985,0.00066929916,0.000005128827],"about_ca_topic_score_codex":0.001659854,"about_ca_topic_score_gemma":0.0009024024,"teacher_disagreement_score":0.001659854,"about_ca_system_score_codex":0.0010894248,"about_ca_system_score_gemma":0.0004740032,"threshold_uncertainty_score":0.007904351},"labels":[],"label_agreement":null},{"id":"W2151262405","doi":"10.1109/jsac.2008.080216","title":"A framework for designing mimo systems with decision feedback equalization or tomlinson-harashima precoding","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"McMaster University","funders":"","keywords":"Precoding; Computer science; Transceiver; Optimal design; MIMO; Mathematical optimization; Convex optimization; Equalization (audio); Control theory (sociology); Mathematics; Algorithm; Regular polygon; Wireless; Decoding methods; Beamforming; Telecommunications","score_opus":0.0727152185128544,"score_gpt":0.320235052790326,"score_spread":0.2475198342774716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151262405","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.0016198144,0.0002452196,0.9954253,0.00010187073,0.00002069438,0.000024422083,0.00001892426,0.00003354042,0.002510377],"genre_scores_gemma":[0.36143062,0.002229741,0.62705594,0.00041552697,0.0002065754,0.00039495263,0.00011040199,0.000049069695,0.00810718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942786,0.00020345591,0.000022249242,0.00010757917,0.00018305471,0.00005579303],"domain_scores_gemma":[0.9997353,0.00010780723,0.00004366924,0.00003294397,0.000065485176,0.000014868808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082167,0.0011431947,0.00055408815,0.000424339,0.00035746445,0.00097055285,0.0008412977,0.0007849094,0.0019340421],"category_scores_gemma":[0.0012397877,0.00034790888,0.0005320366,0.00047186587,0.00081932644,0.0007434839,0.0007550044,0.00097609975,0.00045621567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005336406,0.00007178974,0.00030743045,0.00023345526,0.00006545919,0.00019486125,0.00021806436,0.5437679,0.021782277,0.34444723,0.002552697,0.08630546],"study_design_scores_gemma":[0.000037108286,0.0003580862,0.00020378479,0.000058789232,0.000043548756,0.00015799058,0.000069759626,0.88997376,0.0057017356,0.08941135,0.013946911,0.00003726515],"about_ca_topic_score_codex":0.0011060244,"about_ca_topic_score_gemma":0.0016479086,"teacher_disagreement_score":0.0019340421,"about_ca_system_score_codex":0.00071462675,"about_ca_system_score_gemma":0.0010495151,"threshold_uncertainty_score":0.0064700246},"labels":[],"label_agreement":null},{"id":"W2151430944","doi":"10.1109/jsac.2012.121109","title":"Distributed Robust Scheduling and Power Control For Cognitive Spatial-Reuse TDMA Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of Manitoba","funders":"","keywords":"Computer science; Time division multiple access; Quality of service; Cognitive radio; Power control; Scheduling (production processes); Computer network; Wireless ad hoc network; Distributed computing; Mathematical optimization; Telecommunications link; Wireless; Power (physics); Telecommunications; Mathematics","score_opus":0.051169342244062964,"score_gpt":0.30629756983110895,"score_spread":0.255128227587046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151430944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011866661,0.000113248825,0.9868776,0.00006997047,0.000017610826,0.00002065812,0.000013565121,0.000081314305,0.0009393502],"genre_scores_gemma":[0.85141474,0.00020954596,0.1464486,0.00007403372,0.0000582013,0.00013438621,0.00004374939,0.00003708193,0.0015797693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00020230212,0.000017986868,0.00010333508,0.00015364567,0.00009038292],"domain_scores_gemma":[0.99886405,0.00071859406,0.00017639782,0.000065778906,0.00012146664,0.0000537545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504175,0.00087762845,0.00068672886,0.0003516092,0.00037469968,0.00079416984,0.0009311453,0.00057674834,0.0008467944],"category_scores_gemma":[0.0023288946,0.00034555417,0.0004000867,0.00057997287,0.0009394698,0.0006175808,0.000722439,0.00069151184,0.00016031071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022865,0.00003246954,0.00012480271,0.000028588596,0.000016474844,0.00003597665,0.000033252374,0.97104186,0.0018167644,0.010419296,0.00024686064,0.016153444],"study_design_scores_gemma":[0.000009747085,0.000017087817,0.000020617743,7.550148e-7,0.00000252896,0.0000046205823,0.0000034567638,0.9969554,0.0003263296,0.0025778522,0.00007948942,0.0000021410362],"about_ca_topic_score_codex":0.004467447,"about_ca_topic_score_gemma":0.0035630795,"teacher_disagreement_score":0.004467447,"about_ca_system_score_codex":0.0010622957,"about_ca_system_score_gemma":0.0012112539,"threshold_uncertainty_score":0.00888288},"labels":[],"label_agreement":null},{"id":"W2151922086","doi":"10.1109/jsac.2009.090508","title":"Bridging between ieee 802.15.4 and IEEE 802.11b networks for multiparameter healthcare sensing","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; IEEE 802.15; Bridging (networking); Network packet; IEEE 802; IEEE 802.11; Wireless sensor network; Wireless network; Wireless; Telecommunications; Quality of service","score_opus":0.06139601685089435,"score_gpt":0.34232442747802133,"score_spread":0.280928410627127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151922086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06713728,0.0034200314,0.9084269,0.0022677132,0.00042762645,0.0000969573,0.000034540084,0.00022222406,0.017966844],"genre_scores_gemma":[0.8213687,0.0019672767,0.16846368,0.00049190735,0.00029293515,0.00017528763,0.000045532037,0.00004935532,0.0071453266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882656,0.0005978082,0.000043903558,0.0001221635,0.00029054744,0.000118956355],"domain_scores_gemma":[0.9987696,0.0006713038,0.00016331705,0.0001603234,0.0001769339,0.000058445792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024726337,0.00055217015,0.00037838172,0.0003100123,0.0004850564,0.001438445,0.0012172485,0.002026844,0.0024145895],"category_scores_gemma":[0.003177642,0.00040230626,0.00036799838,0.0004456774,0.0007528526,0.0031949405,0.0013644465,0.001079357,0.00035357187],"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.00022395085,0.0001871001,0.0030889646,0.00019397806,0.00008335346,0.00072547415,0.00041295885,0.43909514,0.011883329,0.44591057,0.0044218376,0.093773335],"study_design_scores_gemma":[0.000028461547,0.00021827253,0.00085971074,0.000045723882,0.000026357295,0.00025710036,0.00011051718,0.89670086,0.0015998076,0.0835543,0.016573979,0.000024959321],"about_ca_topic_score_codex":0.0013866965,"about_ca_topic_score_gemma":0.0010388512,"teacher_disagreement_score":0.0024726337,"about_ca_system_score_codex":0.00078334357,"about_ca_system_score_gemma":0.00086428126,"threshold_uncertainty_score":0.013076723},"labels":[],"label_agreement":null},{"id":"W2151953578","doi":"10.1109/jsac.2008.081006","title":"Grassmannian beamforming for MIMO amplify-and-forward relaying","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":204,"is_retracted":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":"Relay; Beamforming; Transmitter; Codebook; MIMO; Computer science; Grassmannian; Rayleigh fading; Relay channel; Topology (electrical circuits); Channel (broadcasting); Decoding methods; Control theory (sociology); Algorithm; Mathematics; Telecommunications; Fading; Physics; Power (physics)","score_opus":0.0851291242515848,"score_gpt":0.32340873612711685,"score_spread":0.23827961187553204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151953578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008562463,0.00038628565,0.98901355,0.00009529017,0.00002414564,0.000029435629,0.00004567792,0.000049375245,0.0017938059],"genre_scores_gemma":[0.6524839,0.0022285273,0.3387182,0.00012736594,0.00012540915,0.00019745175,0.000189453,0.00004567925,0.0058840956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954456,0.00016924087,0.0000254846,0.00007269226,0.00014762633,0.000040388095],"domain_scores_gemma":[0.9992956,0.0004036585,0.00008743733,0.000053166856,0.00013099685,0.000029048999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794596,0.000589256,0.00056822563,0.00029815795,0.00023463731,0.0007368027,0.00056930963,0.00055685104,0.0015722376],"category_scores_gemma":[0.0022795778,0.00021656265,0.000249778,0.0006265416,0.0005838895,0.00094546814,0.00047203345,0.00044054684,0.00044808706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006758274,0.00002864869,0.00028946932,0.00012841265,0.000021716514,0.00014287877,0.000115376526,0.7938726,0.008915794,0.1163844,0.0017561706,0.07827688],"study_design_scores_gemma":[0.000008844335,0.00004287122,0.00007872037,0.000006142913,0.0000043822565,0.00003446902,0.000019281286,0.9708802,0.0012549439,0.026599456,0.0010609565,0.000009693937],"about_ca_topic_score_codex":0.0021137805,"about_ca_topic_score_gemma":0.0021409967,"teacher_disagreement_score":0.0021137805,"about_ca_system_score_codex":0.0008200907,"about_ca_system_score_gemma":0.0008244688,"threshold_uncertainty_score":0.005950153},"labels":[],"label_agreement":null},{"id":"W2152683746","doi":"10.1109/jsac.2005.845634","title":"Hop count optimal position-based packet routing algorithms for ad hoc wireless networks with a realistic physical Layer","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","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 Ottawa","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Algorithm; Packet forwarding; Distance-vector routing protocol; Network packet; Dynamic Source Routing; Routing protocol; Wireless; Telecommunications","score_opus":0.028573412772905905,"score_gpt":0.29935406266511017,"score_spread":0.27078064989220424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152683746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013181132,0.00029596573,0.98466474,0.00011998444,0.000027315415,0.00006949514,0.000023569062,0.00042417902,0.0011936415],"genre_scores_gemma":[0.24054037,0.00053440395,0.7559516,0.00011894441,0.00004944378,0.0002673419,0.00016597651,0.0000744536,0.0022974294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.0001542358,0.000028719527,0.000078895704,0.00020598937,0.000042911626],"domain_scores_gemma":[0.9991497,0.00044738353,0.00012883205,0.00007599911,0.00016982721,0.000028180986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527779,0.0007900203,0.00066177594,0.0007704951,0.0007018302,0.00063547556,0.0016612705,0.000685201,0.00090232753],"category_scores_gemma":[0.0029136285,0.00037422223,0.0002824024,0.0010882637,0.0007327334,0.0015586999,0.0009407166,0.0007190573,0.00029693867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093163675,0.00005565663,0.0007864135,0.00006488842,0.00003124684,0.00003467429,0.00011683125,0.81093925,0.002070236,0.026949115,0.001827355,0.15703127],"study_design_scores_gemma":[0.000017370074,0.00004578343,0.00009718787,0.0000044089556,0.0000049085547,0.000019471783,0.00002081292,0.9880314,0.00070987665,0.010298659,0.0007447336,0.000005414669],"about_ca_topic_score_codex":0.0024840555,"about_ca_topic_score_gemma":0.0037647574,"teacher_disagreement_score":0.0024840555,"about_ca_system_score_codex":0.0012381149,"about_ca_system_score_gemma":0.0011522213,"threshold_uncertainty_score":0.008983135},"labels":[],"label_agreement":null},{"id":"W2152699740","doi":"10.1109/jsac.2006.879383","title":"Multiuser margin optimization in digital subscriber line (DSL) channels","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"McGill University; Ericsson (Canada)","funders":"","keywords":"Digital subscriber line; Computer science; Margin (machine learning); Mathematical optimization; Optimization problem; Convergence (economics); Algorithm; Computer network; Mathematics","score_opus":0.020241330851360186,"score_gpt":0.25245837444979335,"score_spread":0.23221704359843318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152699740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016380325,0.00014881075,0.9822041,0.00006171526,0.000008278021,0.000010371455,0.000014904174,0.00012992819,0.0010417282],"genre_scores_gemma":[0.80719936,0.00023121761,0.18916993,0.000059295406,0.000029455568,0.00005386272,0.0000493382,0.00008663915,0.0031208796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995695,0.00019019864,0.000012123631,0.00007726231,0.00010126384,0.000049606908],"domain_scores_gemma":[0.9993736,0.00038751357,0.000093633505,0.000046084093,0.00007739399,0.00002179164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073838636,0.00051257026,0.00061690074,0.00019925491,0.00026092623,0.0006512077,0.00047086636,0.00040461434,0.000999287],"category_scores_gemma":[0.0015479972,0.0002872701,0.00026696536,0.00030321904,0.0006726284,0.0008871826,0.00070539047,0.0005144736,0.00032074685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006160786,0.000016554228,0.00019890828,0.000032564105,0.000010439606,0.000025136702,0.000044419994,0.9566361,0.0027954532,0.008642922,0.00037142268,0.03116458],"study_design_scores_gemma":[0.0000035312264,0.000012647569,0.000034120698,0.0000012106105,0.0000011851612,0.0000058763053,0.0000038408125,0.9974228,0.00073996047,0.001567686,0.00020511915,0.0000021122685],"about_ca_topic_score_codex":0.001794242,"about_ca_topic_score_gemma":0.0011505433,"teacher_disagreement_score":0.001794242,"about_ca_system_score_codex":0.00064506865,"about_ca_system_score_gemma":0.0005032221,"threshold_uncertainty_score":0.0046803355},"labels":[],"label_agreement":null},{"id":"W2153797310","doi":"10.1109/jsac.2007.070110","title":"Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Bluetooth and Wireless Communication Technologies","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Bluetooth; Neighbor Discovery Protocol; Wireless ad hoc network; Mobile ad hoc network; Energy consumption; Computer network; Context (archaeology); Node (physics); Distributed computing; Algorithm; Wireless; Telecommunications; The Internet; Network packet","score_opus":0.05909783989474746,"score_gpt":0.3057080406750793,"score_spread":0.24661020078033183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153797310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0487846,0.0012257985,0.94623744,0.00015344686,0.00008784158,0.00021042941,0.000033204713,0.0007550989,0.0025122052],"genre_scores_gemma":[0.6328688,0.0006206344,0.36429453,0.00012100457,0.00006687359,0.0003193135,0.00009002155,0.00009530739,0.0015235047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998609,0.00037333672,0.0000942626,0.0001530652,0.0006636005,0.00010682656],"domain_scores_gemma":[0.99477696,0.0034548917,0.0005278662,0.0006111439,0.0005188774,0.00011023352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024166014,0.0006556585,0.0007348918,0.0011785149,0.0007871227,0.0008699031,0.002868776,0.00076102116,0.0007894728],"category_scores_gemma":[0.010179695,0.00032608898,0.00027777368,0.0009866534,0.00077997043,0.0017400774,0.0010039131,0.0007140937,0.00019056353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039512827,0.00036600087,0.0036115327,0.00026306,0.00012697745,0.00014294061,0.0003691639,0.59805876,0.011518827,0.026764479,0.0018203752,0.35656273],"study_design_scores_gemma":[0.00009089204,0.00018393926,0.0005943354,0.000019097484,0.000040235052,0.00022699997,0.00006793801,0.98532826,0.0036184299,0.0069701383,0.0028270644,0.00003270201],"about_ca_topic_score_codex":0.0012853728,"about_ca_topic_score_gemma":0.0021034922,"teacher_disagreement_score":0.002868776,"about_ca_system_score_codex":0.000678355,"about_ca_system_score_gemma":0.00073029037,"threshold_uncertainty_score":0.012780309},"labels":[],"label_agreement":null},{"id":"W2154364344","doi":"10.1109/jsac.2010.100916","title":"Utility-based asynchronous flow control algorithm for wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":155,"is_retracted":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; Asynchronous communication; Wireless sensor network; Convergence (economics); Throughput; Algorithm; Distributed algorithm; Wireless; Distributed computing; Wireless network; Constraint (computer-aided design); Mathematical optimization; Computer network; Telecommunications","score_opus":0.015537107425479322,"score_gpt":0.26301676662973994,"score_spread":0.24747965920426063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154364344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030640985,0.00007148852,0.9960284,0.00006584186,0.000023989724,0.00002234502,0.000009872103,0.00011178223,0.00060223485],"genre_scores_gemma":[0.5299675,0.00037940583,0.46547914,0.00015186593,0.00013211982,0.00035189168,0.000118223805,0.00008335586,0.0033365341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.00023421469,0.000028999442,0.000124912,0.00017147037,0.00006907802],"domain_scores_gemma":[0.9990702,0.00049258175,0.000106131396,0.00006651846,0.00021529775,0.000049259284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165081,0.0008250554,0.00079907326,0.0006319851,0.0005843524,0.00092548406,0.0014427623,0.0007537661,0.0014410143],"category_scores_gemma":[0.0028414258,0.0002753085,0.0003491765,0.00078140403,0.0007877545,0.0017072423,0.00091878074,0.0012908826,0.0002954406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019742454,0.00011243281,0.0003691582,0.00007801143,0.000024478702,0.00005203709,0.00011733059,0.773828,0.0030112248,0.09216505,0.0023133266,0.1277314],"study_design_scores_gemma":[0.000013696907,0.000014926841,0.000014285693,0.0000019680735,0.0000019066326,0.0000055155147,0.000002991855,0.99163616,0.00022987112,0.0077320444,0.0003444665,0.000002149759],"about_ca_topic_score_codex":0.001888075,"about_ca_topic_score_gemma":0.0013531148,"teacher_disagreement_score":0.001888075,"about_ca_system_score_codex":0.0009663339,"about_ca_system_score_gemma":0.0010857261,"threshold_uncertainty_score":0.0087304115},"labels":[],"label_agreement":null},{"id":"W2154853003","doi":"10.1109/jsac.2007.070609","title":"Physical-Layer p-Cycles Adapted for Router-Level Node Protection: A Multi-Layer Design and Operation Strategy","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network 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 Alberta","funders":"","keywords":"Computer network; Spare part; Computer science; Router; Multiprotocol Label Switching; Node (physics); Quality of service; Engineering","score_opus":0.13580801002464082,"score_gpt":0.3354821410598711,"score_spread":0.1996741310352303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154853003","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.14682645,0.00042822957,0.84518176,0.0002808422,0.000043607906,0.00013555799,0.000035677444,0.00069960684,0.0063683284],"genre_scores_gemma":[0.83047014,0.000182419,0.16691417,0.000090667076,0.00001652235,0.00009045375,0.000027682212,0.00004465687,0.0021633385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999851,0.000032445918,0.00000939414,0.000035003934,0.000042071668,0.000030048977],"domain_scores_gemma":[0.99976915,0.00003440779,0.0000474521,0.00006873002,0.000055582408,0.000024716534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029512055,0.0004136681,0.00018280724,0.00025954595,0.00023377468,0.0004431232,0.0009956738,0.00033611013,0.0009463527],"category_scores_gemma":[0.00036805085,0.00019741773,0.0002675902,0.00018116987,0.00040132224,0.00082393474,0.00035942282,0.00039400242,0.00024141182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033372757,0.00023189952,0.0025801717,0.00025146612,0.000091228474,0.0005719103,0.00029025672,0.3815113,0.29007086,0.075357124,0.0019140991,0.246796],"study_design_scores_gemma":[0.00006260295,0.0007780019,0.0005513541,0.000025127072,0.00007075331,0.00039139722,0.000055131804,0.87266606,0.10133039,0.01523912,0.008796693,0.000033345725],"about_ca_topic_score_codex":0.00063520763,"about_ca_topic_score_gemma":0.00083478313,"teacher_disagreement_score":0.0009956738,"about_ca_system_score_codex":0.0003958049,"about_ca_system_score_gemma":0.0004687173,"threshold_uncertainty_score":0.003165841},"labels":[],"label_agreement":null},{"id":"W2155174176","doi":"10.1109/jsac.2010.101202","title":"Multi-Cell MIMO Cooperative Networks: A New Look at Interference","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1826,"is_retracted":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; MIMO; Base station; 3G MIMO; Scalability; Exploit; Multi-user MIMO; Interference (communication); Distributed computing; Coding (social sciences); Limiting; Wireless; Key (lock); Telecommunications; Computer network; Computer engineering; Beamforming; Computer security; Channel (broadcasting); Engineering","score_opus":0.05416347955178205,"score_gpt":0.31138571373785895,"score_spread":0.2572222341860769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155174176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01256815,0.2453156,0.6537238,0.012382206,0.0025401812,0.000046459332,0.000091384936,0.00018961726,0.07314255],"genre_scores_gemma":[0.5214774,0.3005247,0.13506983,0.0073892684,0.010771841,0.00021625892,0.00012569274,0.00010958507,0.024315432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958307,0.000117705305,0.00001493652,0.00006193,0.00016099028,0.00006147736],"domain_scores_gemma":[0.99942255,0.000350661,0.00004094496,0.000056282577,0.0000969176,0.000032633117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903066,0.00058452063,0.001059697,0.0005606806,0.0006993462,0.0022603623,0.0011709846,0.0016824693,0.0016428549],"category_scores_gemma":[0.0009108043,0.00034064314,0.00046855226,0.000837613,0.0016748633,0.004334485,0.0013025816,0.002287381,0.00043069647],"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.000046335626,0.00003275926,0.0004109318,0.0005312616,0.0000451092,0.00038900823,0.0003658504,0.023729997,0.0037364275,0.8954968,0.0069368095,0.068278745],"study_design_scores_gemma":[0.000015177046,0.00014064283,0.00041851113,0.00034949076,0.00005393816,0.0012667155,0.0005100778,0.10061845,0.0019477885,0.76156396,0.1330412,0.000074029864],"about_ca_topic_score_codex":0.00045834237,"about_ca_topic_score_gemma":0.00066341873,"teacher_disagreement_score":0.0022603623,"about_ca_system_score_codex":0.00087968627,"about_ca_system_score_gemma":0.00041210983,"threshold_uncertainty_score":0.006382644},"labels":[],"label_agreement":null},{"id":"W2155525056","doi":"10.1109/49.995519","title":"Use of cell-site diversity in millimeter-wave fixed cellular systems to combat the effects of rain attenuation","year":2002,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Precipitation Measurement and Analysis","field":"Earth and Planetary Sciences","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":"Attenuation; Radar; Context (archaeology); Computer science; Extremely high frequency; Diversity scheme; Antenna diversity; Telecommunications; Physics; Remote sensing; Fading; Geology; Optics","score_opus":0.0873178313130846,"score_gpt":0.2358966764126971,"score_spread":0.1485788450996125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155525056","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.83334017,0.00036547353,0.16096495,0.000103909435,0.000018718481,0.000029727427,0.0000489602,0.00015744762,0.004970684],"genre_scores_gemma":[0.99364096,0.00007029202,0.006085499,0.00000691021,0.0000030317844,0.0000057240795,0.000010832229,0.0000033724216,0.00017331385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983,0.00006700873,0.000003319092,0.000014565198,0.000045946334,0.000039221093],"domain_scores_gemma":[0.99921787,0.00047224262,0.00008856428,0.00007284683,0.00010811602,0.000040238854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003002443,0.00026926497,0.00024263201,0.00018287037,0.00027213464,0.00034080053,0.00030612253,0.00028344794,0.0007320818],"category_scores_gemma":[0.0013742417,0.00010344729,0.00030532127,0.0004683687,0.00031054328,0.00033695265,0.0003214813,0.0002613328,0.00009555285],"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.000114320064,0.000027587208,0.009587227,0.000032728927,0.000051039406,0.0001414226,0.000083582534,0.95154697,0.011141794,0.0029932,0.00014646407,0.024133619],"study_design_scores_gemma":[0.000023320477,0.0005053694,0.0059157503,0.000007303283,0.00004977204,0.00024075063,0.00009081757,0.98185617,0.007923797,0.0024359908,0.0009362339,0.00001465847],"about_ca_topic_score_codex":0.0020299389,"about_ca_topic_score_gemma":0.0028178296,"teacher_disagreement_score":0.0020299389,"about_ca_system_score_codex":0.0003644328,"about_ca_system_score_gemma":0.00023844141,"threshold_uncertainty_score":0.0040363073},"labels":[],"label_agreement":null},{"id":"W2155896481","doi":"10.1109/jsac.2006.1613775","title":"Separating resource reservations from service requests to improve the performance of optical burst-switching networks","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","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 Toronto","funders":"","keywords":"Header; Computer science; Optical burst switching; Offset (computer science); Computer network; Scheduling (production processes); Reservation; Quality of service; Wavelength; Wavelength-division multiplexing; Materials science; Optical performance monitoring; Optoelectronics","score_opus":0.016785152387515462,"score_gpt":0.2638339924113971,"score_spread":0.24704884002388164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155896481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48560378,0.0010003214,0.506182,0.0004350806,0.00016507578,0.000066800596,0.000044082906,0.0013463133,0.0051565845],"genre_scores_gemma":[0.9503878,0.0001870697,0.04837179,0.00007648969,0.000060079605,0.000015108412,0.00003678152,0.000056296252,0.00080858014],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.00010318783,0.000027015827,0.000078628305,0.00016533726,0.000109821915],"domain_scores_gemma":[0.99852824,0.00077865855,0.00014334716,0.00030227794,0.00016843839,0.00007901403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803034,0.0005530453,0.00033997334,0.00030887825,0.00055684365,0.0007856853,0.00088506035,0.00029011327,0.0012822102],"category_scores_gemma":[0.0032130508,0.0001931896,0.00011876668,0.00037259117,0.00051442115,0.0014898281,0.0006396658,0.00070423016,0.00026749788],"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.0013771303,0.0004516993,0.007990676,0.00019902945,0.000062505795,0.00025497755,0.00041667887,0.23724985,0.35840362,0.06385685,0.002250463,0.32748654],"study_design_scores_gemma":[0.00013824303,0.00049655256,0.0025455307,0.00002378028,0.00006418925,0.00017758699,0.00009863441,0.8495184,0.116685376,0.020948617,0.009258978,0.00004410825],"about_ca_topic_score_codex":0.0014224864,"about_ca_topic_score_gemma":0.0015810325,"teacher_disagreement_score":0.0014224864,"about_ca_system_score_codex":0.0006037836,"about_ca_system_score_gemma":0.001365452,"threshold_uncertainty_score":0.006242156},"labels":[],"label_agreement":null},{"id":"W2156260722","doi":"10.1109/jsac.2007.071205","title":"R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":286,"is_retracted":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; Upload; Linear network coding; Testbed; Computer network; Server; Peer-to-peer; Multicast; BitTorrent; World Wide Web; Network packet","score_opus":0.03754363206759547,"score_gpt":0.3099601509320104,"score_spread":0.2724165188644149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156260722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053859204,0.00018353995,0.99120283,0.00013754387,0.000038992064,0.00008360162,0.00003113507,0.00042639876,0.002509987],"genre_scores_gemma":[0.34088683,0.00074575376,0.6486137,0.00037948604,0.00016039629,0.00058475515,0.00019577562,0.0003530797,0.008080213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984005,0.0006978584,0.000064517044,0.0002475957,0.00048341384,0.00010606612],"domain_scores_gemma":[0.99748105,0.0016311458,0.00016319114,0.00027683002,0.0003453302,0.00010257667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675953,0.00072150846,0.00068386627,0.00078537065,0.00056199596,0.0010149287,0.0016951833,0.0012788634,0.0019898962],"category_scores_gemma":[0.007955136,0.00037198604,0.0006274075,0.0007620121,0.0019474966,0.002360233,0.0021011203,0.0015838055,0.00080617424],"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.0002524796,0.000074319396,0.00049578,0.00021163894,0.00004231313,0.00028985602,0.00028545858,0.432656,0.011236455,0.43985784,0.0034643766,0.11113345],"study_design_scores_gemma":[0.000030070465,0.00006199089,0.000050306564,0.000019655727,0.000007963397,0.00008988537,0.000018802923,0.9419728,0.00351056,0.05132828,0.0028878346,0.000021864382],"about_ca_topic_score_codex":0.0023871604,"about_ca_topic_score_gemma":0.001430645,"teacher_disagreement_score":0.002675953,"about_ca_system_score_codex":0.0010432533,"about_ca_system_score_gemma":0.0014473895,"threshold_uncertainty_score":0.014151931},"labels":[],"label_agreement":null},{"id":"W2156544663","doi":"10.1109/49.848249","title":"Optimal mode selection and synchronization for robust video communications over error-prone networks","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":209,"is_retracted":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; Encoder; Synchronization (alternating current); Channel (broadcasting); Bit error rate; Real-time computing; Coding (social sciences); Decoding methods; Algorithm; Computer network","score_opus":0.04229689627875186,"score_gpt":0.307780707519767,"score_spread":0.2654838112410151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156544663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014903976,0.0004077373,0.98370194,0.000048726266,0.00001668278,0.000020341984,0.000009383769,0.00016690967,0.0007243166],"genre_scores_gemma":[0.5885444,0.00087473216,0.40807694,0.00006361654,0.00009631046,0.00011056559,0.000054538956,0.000070652735,0.0021082181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.00012532156,0.000015848846,0.000043542226,0.0001589099,0.000025128167],"domain_scores_gemma":[0.99957126,0.00020331188,0.00009626284,0.00006145436,0.000056055134,0.000011736064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042103574,0.00045058568,0.00026915202,0.00028024838,0.00019633851,0.00032132838,0.00042471007,0.00031502097,0.00103197],"category_scores_gemma":[0.0018638542,0.00016195576,0.000119818425,0.00027033815,0.0003757435,0.0006237386,0.00039821005,0.00034266614,0.00030722682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036014811,0.00006858839,0.000854386,0.00018657795,0.000049596954,0.00024715345,0.00019585554,0.47611678,0.1388297,0.05802103,0.0017720553,0.3232982],"study_design_scores_gemma":[0.00002474461,0.00015770485,0.00023251386,0.000013525466,0.000016627042,0.00015407513,0.000019827978,0.9590312,0.028927322,0.008663297,0.00274162,0.000017507042],"about_ca_topic_score_codex":0.00049686263,"about_ca_topic_score_gemma":0.0007326322,"teacher_disagreement_score":0.00103197,"about_ca_system_score_codex":0.00023945753,"about_ca_system_score_gemma":0.00035022316,"threshold_uncertainty_score":0.0034522414},"labels":[],"label_agreement":null},{"id":"W2157007424","doi":"10.1109/jsac.2012.121203","title":"Local Public Good Provisioning in Networks: A Nash Implementation Mechanism","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"National Science Foundation","keywords":"Nash equilibrium; Computer science; Resource allocation; Game theory; Resource management (computing); Provisioning; Computer network; Distributed computing; Microeconomics; Economics","score_opus":0.12701392583292104,"score_gpt":0.4250878217861445,"score_spread":0.2980738959532235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157007424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057844706,0.00019794794,0.91439176,0.0016166244,0.00004535044,0.00022397138,0.000037776394,0.00018247892,0.025459256],"genre_scores_gemma":[0.8932668,0.00025502578,0.09835872,0.0003034149,0.00006800827,0.0004467592,0.000023743907,0.00003963423,0.0072378274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960503,0.002427736,0.0001061099,0.0004718803,0.00057770265,0.00036631123],"domain_scores_gemma":[0.9960769,0.0022873448,0.0006572326,0.00047260246,0.0003085959,0.00019737126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046732044,0.000508244,0.0007213885,0.0007650174,0.0012023402,0.0027703492,0.0017496763,0.0016945977,0.0032766885],"category_scores_gemma":[0.0077763777,0.00041102467,0.0006585455,0.0007502893,0.0032309808,0.004979044,0.002348595,0.0013476759,0.00039609685],"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.00010245629,0.0001379113,0.0006121035,0.00008978254,0.000056605433,0.00014692136,0.00032306934,0.09864837,0.0017476279,0.8802653,0.0010357448,0.016834188],"study_design_scores_gemma":[0.00015499997,0.00011667487,0.00026432474,0.000050735973,0.0000405107,0.00013179038,0.00016827992,0.4055684,0.0018539053,0.58496195,0.0066467077,0.000041737738],"about_ca_topic_score_codex":0.0010576175,"about_ca_topic_score_gemma":0.0010129928,"teacher_disagreement_score":0.0046732044,"about_ca_system_score_codex":0.002022008,"about_ca_system_score_gemma":0.0019561946,"threshold_uncertainty_score":0.02471453},"labels":[],"label_agreement":null},{"id":"W2157161648","doi":"10.1109/jsac.2004.829642","title":"Topological Design Optimization of a Yottabit-Per-Second Lattice Network","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","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; Group for Research in Decision Analysis","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Tabu search; Lattice (music); Agile software development; Topology (electrical circuits); Network planning and design; Enhanced Data Rates for GSM Evolution; Network topology; Algorithm; Theoretical computer science; Computer network; Mathematics; Telecommunications; Combinatorics","score_opus":0.03334551206238005,"score_gpt":0.2723096126520984,"score_spread":0.23896410058971834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157161648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24901623,0.00062339305,0.731734,0.00061618956,0.0001095807,0.00010560839,0.00012035591,0.0003347434,0.017339917],"genre_scores_gemma":[0.8345949,0.00024382723,0.16163547,0.000065208034,0.000016666667,0.00013255254,0.00007450757,0.00006201602,0.003174793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997353,0.0001209856,0.0000082078595,0.00003097277,0.00005677819,0.000047788144],"domain_scores_gemma":[0.99947125,0.00026714295,0.00007702542,0.000028867455,0.00010469144,0.000051018007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605053,0.00036821244,0.0004844213,0.00060330157,0.0004215299,0.00068405137,0.00061889185,0.00058291724,0.0023487504],"category_scores_gemma":[0.0014745229,0.00027480107,0.00022955156,0.00044651324,0.0005255483,0.00091418286,0.00051140337,0.00044469332,0.0003047667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009167621,0.000045053683,0.00048743392,0.000048250986,0.000011711925,0.00004737715,0.00003443771,0.94502854,0.0038451988,0.019722516,0.000767388,0.029870445],"study_design_scores_gemma":[0.000012991614,0.0000620331,0.00006931931,0.000004410018,0.0000031474326,0.000022808475,0.000025494,0.99488336,0.0007779006,0.0033591161,0.0007747888,0.000004591382],"about_ca_topic_score_codex":0.0009364702,"about_ca_topic_score_gemma":0.001377892,"teacher_disagreement_score":0.0023487504,"about_ca_system_score_codex":0.0008997709,"about_ca_system_score_gemma":0.0005864218,"threshold_uncertainty_score":0.007857382},"labels":[],"label_agreement":null},{"id":"W2157528396","doi":"10.1109/49.963806","title":"A centralized TDMA-based scheme for fair bandwidth allocation in wireless IP networks","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 Victoria; University of Manitoba","funders":"","keywords":"Computer science; Time division multiple access; Computer network; Dynamic bandwidth allocation; Network packet; Burstiness; Bandwidth (computing); Throughput; Statistical time division multiplexing; Real-time computing; Bandwidth allocation; Wireless network; Wireless; Multiplexing; Telecommunications","score_opus":0.02196277399214083,"score_gpt":0.273256167998865,"score_spread":0.2512933940067242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157528396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010445907,0.00027564217,0.9873269,0.00005225347,0.00008397733,0.000090560636,0.000021134449,0.00071589166,0.0009876813],"genre_scores_gemma":[0.6895066,0.00023270976,0.30763125,0.000094000745,0.00016741487,0.00025720563,0.000081143364,0.00007376725,0.001955942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.00028907068,0.000067528235,0.00022316632,0.00033407754,0.00011408063],"domain_scores_gemma":[0.99877065,0.00031858767,0.00012172174,0.00033681255,0.00034970263,0.00010251914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020546068,0.00057520624,0.0010470394,0.0007573972,0.0011425986,0.0013406542,0.0029331187,0.0006415754,0.0012773861],"category_scores_gemma":[0.0031591211,0.00029439916,0.00043946342,0.0007656617,0.0011372236,0.0012283623,0.0010523179,0.0011627626,0.00033155573],"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.00066604983,0.00038444254,0.001428346,0.00027950833,0.00014406948,0.0003862952,0.00045460326,0.29356617,0.094131015,0.120353736,0.0062284805,0.48197725],"study_design_scores_gemma":[0.00007798282,0.00020098622,0.00033199563,0.000012183427,0.000042989548,0.00019155354,0.000022811795,0.9749287,0.011851055,0.008665536,0.0036346281,0.000039561968],"about_ca_topic_score_codex":0.0021585072,"about_ca_topic_score_gemma":0.0023125042,"teacher_disagreement_score":0.0029331187,"about_ca_system_score_codex":0.001609203,"about_ca_system_score_gemma":0.002044166,"threshold_uncertainty_score":0.011675656},"labels":[],"label_agreement":null},{"id":"W2157862977","doi":"10.1109/jsac.2009.090408","title":"Configuration management at massive scale: system design and experience","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":73,"is_retracted":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":"Precursory Research for Embryonic Science and Technology","keywords":"Computer science; Configuration Management (ITSM); Scripting language; Network management; Service provider; Service (business); Software engineering; World Wide Web; Computer network; Operating system","score_opus":0.028178992410262498,"score_gpt":0.27355276209003065,"score_spread":0.24537376967976815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157862977","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.595023,0.0009763522,0.3460297,0.0013123823,0.000116241456,0.001224091,0.00029430664,0.011363046,0.04366097],"genre_scores_gemma":[0.8218277,0.00057411264,0.16948093,0.00015533011,0.000036713835,0.00039206244,0.00045555396,0.00077775057,0.0062998515],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743855,0.0011106418,0.000131305,0.0004079019,0.00073178695,0.00017986298],"domain_scores_gemma":[0.99358493,0.0028573885,0.00026801496,0.0018042449,0.0009895889,0.00049581926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042007654,0.00045817945,0.00046030566,0.0005866155,0.0009665802,0.0028192634,0.0021546339,0.00069370394,0.00548713],"category_scores_gemma":[0.010490888,0.0005315978,0.00024077669,0.000988302,0.0011336154,0.0035810953,0.0018986469,0.0010140573,0.0010369241],"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.0013325706,0.0018725491,0.024326479,0.00049841416,0.00009771805,0.0012128842,0.009800322,0.09146718,0.027913963,0.02845077,0.016445309,0.7965818],"study_design_scores_gemma":[0.0008323224,0.0037087535,0.028309895,0.00051000685,0.00021235002,0.0028114992,0.0063932114,0.72800195,0.058380328,0.036720365,0.133778,0.00034139163],"about_ca_topic_score_codex":0.0029223312,"about_ca_topic_score_gemma":0.0028352207,"teacher_disagreement_score":0.00548713,"about_ca_system_score_codex":0.0013845764,"about_ca_system_score_gemma":0.0017034303,"threshold_uncertainty_score":0.022216082},"labels":[],"label_agreement":null},{"id":"W2158743596","doi":"10.1109/jsac.2007.070105","title":"Outreach: peer-to-peer topology construction towards minimized server bandwidth costs","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","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":"University of Toronto","funders":"","keywords":"Computer science; Network topology; Computer network; Server; Scalability; Upload; Bandwidth (computing); Overlay; Overlay network; Peer-to-peer; Outreach; Bandwidth allocation; Distributed computing; Multimedia; The Internet; World Wide Web; Operating system","score_opus":0.03574784777431684,"score_gpt":0.32129470986717157,"score_spread":0.28554686209285474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158743596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05054404,0.00024109296,0.943663,0.00024175306,0.00004020098,0.00028111992,0.000080426995,0.001601728,0.0033066343],"genre_scores_gemma":[0.6012706,0.00032934165,0.39486954,0.00013980064,0.000043086005,0.00028877668,0.00032274716,0.00021363476,0.00252247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.00025713138,0.000025832183,0.000113146714,0.00024398585,0.000079586556],"domain_scores_gemma":[0.99800724,0.0008511455,0.00029078568,0.00032650944,0.00031890025,0.00020545203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011433325,0.00091862807,0.0009743877,0.0008913819,0.001103897,0.00091051875,0.0022247687,0.0008375882,0.0016456376],"category_scores_gemma":[0.004633818,0.0004163119,0.0003821323,0.00077959744,0.000805786,0.0019658576,0.002389659,0.0007393147,0.0002986413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002654489,0.00026968517,0.0018394431,0.000387705,0.000054861448,0.00035842488,0.0004955872,0.6926955,0.028434597,0.028485615,0.006222085,0.24049108],"study_design_scores_gemma":[0.000057537116,0.00023300378,0.00036477184,0.000020545289,0.000021270977,0.00029819802,0.00017353227,0.97163796,0.009129317,0.0141335,0.00391211,0.000018268149],"about_ca_topic_score_codex":0.0016340315,"about_ca_topic_score_gemma":0.0024887563,"teacher_disagreement_score":0.0022247687,"about_ca_system_score_codex":0.00085293886,"about_ca_system_score_gemma":0.0012892552,"threshold_uncertainty_score":0.0061885715},"labels":[],"label_agreement":null},{"id":"W2159841853","doi":"10.1109/jsac.2014.141124","title":"Core-Selecting Secondary Spectrum Auctions","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Calgary; University of Toronto","funders":"","keywords":"Common value auction; Computer science; Combinatorial auction; Mechanism design; Bidding; Collusion; Core (optical fiber); Auction theory; Vickrey–Clarke–Groves auction; Payment; Context (archaeology); Spectrum auction; Revenue; Mathematical optimization; Revenue equivalence; Microeconomics; Economics; Mathematics","score_opus":0.1683251176500577,"score_gpt":0.41165682272686127,"score_spread":0.24333170507680357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159841853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04910371,0.00026512617,0.93809175,0.00029383728,0.00008703392,0.00024925376,0.00012199856,0.00029800748,0.011489267],"genre_scores_gemma":[0.90580535,0.00022578011,0.08977841,0.00022011224,0.000099999736,0.0001643516,0.0001165444,0.00005240149,0.003536954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522275,0.0021832013,0.00026058184,0.00065965607,0.0011287016,0.0005451131],"domain_scores_gemma":[0.9922231,0.0033869264,0.0008883848,0.0017574073,0.001303814,0.00044040018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041104252,0.0009053361,0.0016311209,0.0007133605,0.0005376032,0.0023148102,0.0021246152,0.0011923363,0.0028083685],"category_scores_gemma":[0.015062255,0.00047489116,0.0006827091,0.001181193,0.0013943086,0.0023117145,0.0016266939,0.0012345456,0.00071316847],"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.0008602979,0.0004878039,0.0025707027,0.00048823064,0.00014654052,0.0007270475,0.0003627681,0.3484902,0.017208245,0.45334065,0.010321158,0.16499637],"study_design_scores_gemma":[0.00013889291,0.0002507587,0.00054141774,0.00005041154,0.000036681715,0.00065926515,0.00007062028,0.7901438,0.0045354576,0.19930345,0.00422929,0.000039990246],"about_ca_topic_score_codex":0.00033515866,"about_ca_topic_score_gemma":0.00036858048,"teacher_disagreement_score":0.0041104252,"about_ca_system_score_codex":0.000812602,"about_ca_system_score_gemma":0.0014316973,"threshold_uncertainty_score":0.02173829},"labels":[],"label_agreement":null},{"id":"W2160192036","doi":"10.1109/jsac.2008.080512","title":"A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","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":"Concordia University","funders":"","keywords":"Computer science; Robustness (evolution); Scalability; Queueing theory; Routing (electronic design automation); Mathematical optimization; Robust control; Distributed computing; Algorithm; Computer network; Control system; Mathematics; Engineering","score_opus":0.05476329905381612,"score_gpt":0.27783920908673765,"score_spread":0.22307591003292154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160192036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021665627,0.00006535207,0.99561113,0.000045327884,0.000028960558,0.000030017072,0.0000076170872,0.00010199319,0.0019431022],"genre_scores_gemma":[0.6878253,0.0003741858,0.30555555,0.00021006481,0.00015525012,0.00041142837,0.00009520926,0.0000843525,0.005288662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.0000920673,0.000021034728,0.00017058705,0.00013336491,0.00005102869],"domain_scores_gemma":[0.9996997,0.00009574543,0.00006960376,0.000030590934,0.000085261774,0.000019121311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401476,0.0009966457,0.000723437,0.00038329908,0.00042357817,0.000928487,0.001267813,0.00093542103,0.0019659905],"category_scores_gemma":[0.00090870226,0.00028509114,0.00050553825,0.00033079673,0.0006176264,0.0006382951,0.00061596534,0.0007948955,0.000499081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005990508,0.000072400326,0.00019540594,0.00015694182,0.000036977868,0.000107335145,0.000095718744,0.8248216,0.017501876,0.038137577,0.0019203653,0.11689396],"study_design_scores_gemma":[0.000014715344,0.00010279204,0.000055481818,0.000008137334,0.000006715673,0.00002572135,0.000008390749,0.9932533,0.0015395951,0.0032947469,0.0016824341,0.000008092887],"about_ca_topic_score_codex":0.0016315007,"about_ca_topic_score_gemma":0.0013313802,"teacher_disagreement_score":0.0019659905,"about_ca_system_score_codex":0.0005969008,"about_ca_system_score_gemma":0.0009827646,"threshold_uncertainty_score":0.0065768957},"labels":[],"label_agreement":null},{"id":"W2161060874","doi":"10.1109/jsac.2012.120207","title":"CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Routing protocol; Node (physics); Network packet; Optimized Link State Routing Protocol; Distributed computing; Broadcasting (networking); Wireless; Telecommunications","score_opus":0.049739119508639754,"score_gpt":0.30679542447167674,"score_spread":0.257056304963037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161060874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059679605,0.0026577176,0.9171239,0.00081404985,0.0005577723,0.0008435213,0.000198733,0.0035785113,0.014546102],"genre_scores_gemma":[0.7107566,0.0011523791,0.27724135,0.0005990766,0.00014782783,0.0005287586,0.00035516766,0.0001267064,0.009092162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.0002611471,0.000052280502,0.00012739522,0.00032587492,0.00014112478],"domain_scores_gemma":[0.9988294,0.00033961295,0.00018799466,0.00027497933,0.0002651291,0.00010285727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013065856,0.000689533,0.0007487961,0.00089831377,0.0010749128,0.00082384486,0.0023275919,0.00079426816,0.00087542273],"category_scores_gemma":[0.0023534142,0.00023627837,0.00040142593,0.0010645939,0.00077091437,0.0014541743,0.0019813427,0.0007635076,0.00026484366],"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.00074574153,0.0004328088,0.0025147523,0.00064663525,0.00021729956,0.0013775153,0.0010450451,0.19631764,0.053459894,0.09745849,0.02059853,0.6251857],"study_design_scores_gemma":[0.00015967734,0.0005212717,0.0005743904,0.000057208857,0.00008435616,0.0010551899,0.00019987002,0.9205274,0.010721748,0.021136574,0.044868737,0.00009359959],"about_ca_topic_score_codex":0.0041654687,"about_ca_topic_score_gemma":0.006725231,"teacher_disagreement_score":0.0041654687,"about_ca_system_score_codex":0.0007734022,"about_ca_system_score_gemma":0.001927548,"threshold_uncertainty_score":0.008282423},"labels":[],"label_agreement":null},{"id":"W2162906436","doi":"10.1109/jsac.2007.070122","title":"Diverse: application-layer service differentiation in peer-to-peer communications","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Scalability; Upload; Computer network; Multimedia; The Internet; Application layer; Differentiated services; Quality of service; Bandwidth (computing); Service (business); Server; Distributed computing; World Wide Web; Operating system","score_opus":0.050234549141776955,"score_gpt":0.3295456896473329,"score_spread":0.27931114050555594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162906436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020615337,0.0012889487,0.9659809,0.0004223552,0.00023355754,0.00034964387,0.00008868548,0.0054677213,0.005552938],"genre_scores_gemma":[0.5492379,0.0010687344,0.44205025,0.0006474325,0.00026937996,0.00034792806,0.00026830443,0.00035969692,0.0057502487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.00048971985,0.00015636675,0.00024204516,0.0007757477,0.00016610394],"domain_scores_gemma":[0.997823,0.0006174079,0.00017796498,0.0004722587,0.00063876953,0.00027058375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358867,0.0006178136,0.0008343143,0.0008574978,0.0010285117,0.0018486344,0.0022430664,0.0010763366,0.0014677228],"category_scores_gemma":[0.004723009,0.0003652885,0.00034806514,0.0009371418,0.0010074395,0.0018540969,0.0023566105,0.0018181752,0.00088452006],"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.0012049854,0.0004868103,0.0027677186,0.00076781644,0.00015571104,0.0011171887,0.00097310037,0.12013376,0.1382388,0.13474187,0.019538406,0.57987386],"study_design_scores_gemma":[0.00023955261,0.0005270125,0.00094954885,0.000088899025,0.00008287833,0.0015158843,0.00022765333,0.80223566,0.0633647,0.055628873,0.07498006,0.00015925869],"about_ca_topic_score_codex":0.0010097441,"about_ca_topic_score_gemma":0.0012505066,"teacher_disagreement_score":0.002358867,"about_ca_system_score_codex":0.0008411378,"about_ca_system_score_gemma":0.001060652,"threshold_uncertainty_score":0.012475014},"labels":[],"label_agreement":null},{"id":"W2163505268","doi":"10.1109/jsacocn.2008.032107","title":"Pseudolinear optical system reach enhancement via runlength-limited coding","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Coding (social sciences); Benchmark (surveying); Keying; Polarization mode dispersion; Transmission (telecommunications); Transmission system; Optical communication; Phase-shift keying; Electronic engineering; Telecommunications; Decoding methods; Bit error rate; Optical fiber; Mathematics; Engineering","score_opus":0.03282729011469974,"score_gpt":0.2568557962429638,"score_spread":0.22402850612826405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163505268","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.71540636,0.00058484246,0.26616907,0.00029242723,0.000040658608,0.000044588312,0.00004249051,0.00040417773,0.017015314],"genre_scores_gemma":[0.9774335,0.0001393516,0.021394977,0.000028126571,0.000009180152,0.000018876119,0.000014034473,0.000016585453,0.0009452685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981123,0.000054274657,0.0000074136815,0.00001806756,0.000082821345,0.00002619315],"domain_scores_gemma":[0.99911803,0.0004931417,0.00019126388,0.00007841679,0.00008545867,0.000033624485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026555368,0.00026164344,0.00013931263,0.00021043031,0.00019082207,0.0003621194,0.0003396863,0.0002709869,0.0011972568],"category_scores_gemma":[0.0010704746,0.0000843542,0.000103320024,0.00016023505,0.0005007314,0.00069911696,0.00049558835,0.00032629265,0.00018263825],"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.00045539576,0.00010871098,0.0009820445,0.00027678316,0.000021142707,0.00034082608,0.00038132636,0.20584804,0.6543129,0.078121975,0.0005797084,0.058571186],"study_design_scores_gemma":[0.000061214945,0.0006113424,0.0005167832,0.0000270615,0.000014535873,0.00031835964,0.00004390785,0.75884646,0.22546451,0.010669929,0.003383875,0.000042067484],"about_ca_topic_score_codex":0.00030794088,"about_ca_topic_score_gemma":0.00043299687,"teacher_disagreement_score":0.0011972568,"about_ca_system_score_codex":0.00029292871,"about_ca_system_score_gemma":0.00026596518,"threshold_uncertainty_score":0.0040051937},"labels":[],"label_agreement":null},{"id":"W2165357407","doi":"10.1109/jsac.2007.070517","title":"Packet prioritization in multihop latency aware scheduling for delay constrained communication","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Scheduling (production processes); Schedule; Transmission delay; Latency (audio); Wireless network; Transmission (telecommunications); Distributed computing; Wireless; Mathematical optimization; Telecommunications","score_opus":0.03923119684007823,"score_gpt":0.3372392143749134,"score_spread":0.29800801753483513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165357407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116703294,0.0011082863,0.879711,0.00018729991,0.00006220322,0.000060567767,0.000023202536,0.00019569647,0.00194851],"genre_scores_gemma":[0.9018171,0.0005212419,0.09618001,0.000053858523,0.00004781805,0.000050673047,0.000023484681,0.00006198611,0.0012438742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995272,0.00018891219,0.000020943075,0.000055577435,0.00014173963,0.00006558522],"domain_scores_gemma":[0.9981858,0.0013241839,0.00019190082,0.00008129087,0.00014536998,0.00007139713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017502209,0.0005158581,0.00038983216,0.0004638497,0.00043303875,0.00061346573,0.00069155503,0.00032410136,0.0005577243],"category_scores_gemma":[0.00470343,0.00030760697,0.00014394987,0.0005046276,0.0003679454,0.00094363984,0.00038720085,0.0004617271,0.00010636891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020369164,0.00006566872,0.0010254473,0.000116299445,0.000025099545,0.00008970894,0.00016446163,0.8780561,0.012327655,0.028230336,0.00050256145,0.07919293],"study_design_scores_gemma":[0.000015151002,0.00008400964,0.00021571747,0.000005567978,0.000011058587,0.000027390477,0.000024259585,0.99059814,0.0024879286,0.0059233275,0.000601006,0.0000065273493],"about_ca_topic_score_codex":0.0017582428,"about_ca_topic_score_gemma":0.003118318,"teacher_disagreement_score":0.0017582428,"about_ca_system_score_codex":0.0009997773,"about_ca_system_score_gemma":0.0010690117,"threshold_uncertainty_score":0.0092561245},"labels":[],"label_agreement":null},{"id":"W2165651458","doi":"10.1109/jsac.2004.830465","title":"A Multilayer Differentiated Protection Services Architecture","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network 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":"Lakehead University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; Distributed computing; Scalability; Protocol stack; Network architecture; Differentiated services; Bandwidth (computing); Architecture; Wireless sensor network; Quality of service; Database","score_opus":0.018710790157219156,"score_gpt":0.2534573041915012,"score_spread":0.23474651403428204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165651458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105159916,0.0019012241,0.8218927,0.0033860044,0.00032260604,0.00031412632,0.0005225283,0.007699723,0.058801264],"genre_scores_gemma":[0.7199015,0.0012319915,0.25223678,0.000737915,0.00019203631,0.00016003926,0.00077253295,0.00013881228,0.024628375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.00008217793,0.000046056513,0.00006689128,0.00022057972,0.0001294664],"domain_scores_gemma":[0.99943155,0.000053471427,0.000052613217,0.00015080244,0.00021042216,0.0001011222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079221145,0.00039617767,0.0002821793,0.00065643975,0.0009518217,0.002827622,0.0010810766,0.00097997,0.0033410517],"category_scores_gemma":[0.0008770612,0.00031286807,0.0004931556,0.0008214254,0.0006682405,0.0023760227,0.0017894692,0.00096518465,0.0014459705],"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.00081298815,0.000337326,0.0040744324,0.00033362617,0.00014611545,0.0007471873,0.001049544,0.10294933,0.06681627,0.49013412,0.030618748,0.30198035],"study_design_scores_gemma":[0.0000999338,0.0003721254,0.002030801,0.0001194159,0.00016195228,0.0006211991,0.00026438036,0.6845548,0.022284066,0.12900805,0.16036692,0.00011631415],"about_ca_topic_score_codex":0.0075849835,"about_ca_topic_score_gemma":0.0058849645,"teacher_disagreement_score":0.0075849835,"about_ca_system_score_codex":0.0022363276,"about_ca_system_score_gemma":0.0017164676,"threshold_uncertainty_score":0.016225696},"labels":[],"label_agreement":null},{"id":"W2166084780","doi":"10.1109/49.848261","title":"A concealment method for video communications in an error-prone environment","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","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 British Columbia","funders":"University of British Columbia","keywords":"Computer science; Markov random field; Estimator; Maximum a posteriori estimation; Artificial intelligence; Block (permutation group theory); A priori and a posteriori; Computer vision; Motion estimation; Pixel; Motion compensation; Algorithm; Image (mathematics); Maximum likelihood; Mathematics; Image segmentation","score_opus":0.09301962795035137,"score_gpt":0.37349359408240157,"score_spread":0.2804739661320502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166084780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037001318,0.00041204304,0.9954665,0.00004695568,0.000033919718,0.000016152086,0.000010610168,0.00012954102,0.00018419044],"genre_scores_gemma":[0.15852658,0.00095906877,0.8365423,0.000075393225,0.00009754254,0.00007012125,0.000072720744,0.000052836076,0.003603421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.000073807925,0.000021141928,0.000055028366,0.00024077318,0.000027490276],"domain_scores_gemma":[0.9992323,0.0002639952,0.0001232492,0.00016010058,0.00018785016,0.000032493263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005357024,0.0005773654,0.00050679,0.00070765987,0.00039135618,0.00045987015,0.0008876011,0.0009317869,0.0011323602],"category_scores_gemma":[0.0019292267,0.00027350124,0.00044443036,0.00038239686,0.00037337074,0.0012855558,0.0006549653,0.00093912386,0.000622744],"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.0006292085,0.00009644349,0.0007036868,0.0004113235,0.000112409434,0.000306846,0.00024007473,0.07920039,0.17176205,0.037307553,0.0020565342,0.7071735],"study_design_scores_gemma":[0.00006441686,0.0002905572,0.0005747384,0.00004934036,0.000074437026,0.0011139232,0.000032658518,0.8714631,0.10702919,0.0068697236,0.012368581,0.00006928878],"about_ca_topic_score_codex":0.0010963483,"about_ca_topic_score_gemma":0.000861496,"teacher_disagreement_score":0.0011323602,"about_ca_system_score_codex":0.00035021952,"about_ca_system_score_gemma":0.0006076096,"threshold_uncertainty_score":0.0037881732},"labels":[],"label_agreement":null},{"id":"W2167258973","doi":"10.1109/jsac.2007.070614","title":"Load-Balancing Data Traffic Among Inter-Domain Links","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","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; University of Regina","funders":"","keywords":"Computer science; Computer network; The Internet; Internet transit; Internet backbone; Network congestion; Internet traffic engineering; Service (business); Bandwidth (computing); Internet traffic; Network traffic control; Inter-domain; Internet exchange point; World Wide Web; Multicast","score_opus":0.034040660144077355,"score_gpt":0.29568975948427173,"score_spread":0.26164909934019437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167258973","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.66379,0.0006640048,0.32257992,0.00059117936,0.0002101512,0.0002856078,0.00016454954,0.0021712992,0.009543327],"genre_scores_gemma":[0.9786057,0.00008223742,0.019571897,0.00006545144,0.00007419237,0.000047962898,0.00011223577,0.00006183865,0.0013785488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992855,0.0001420757,0.000046978887,0.0001377594,0.00025455054,0.00013312543],"domain_scores_gemma":[0.99826175,0.0003866445,0.00018273044,0.00026428717,0.0007017799,0.00020275355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007444761,0.00055516476,0.0006325681,0.0011595654,0.0010431504,0.0013303839,0.001418739,0.0006368491,0.0016474334],"category_scores_gemma":[0.0036598674,0.00020173262,0.00019997686,0.00083004194,0.0004320306,0.0012252885,0.0009552544,0.0005042826,0.00063668523],"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.002129782,0.0015098715,0.015099217,0.00027200676,0.00014292361,0.00039263067,0.0006663756,0.20271981,0.27328977,0.01554977,0.007737664,0.48049018],"study_design_scores_gemma":[0.00011277457,0.0003047973,0.0031964164,0.00001703486,0.00004856215,0.0002540949,0.00036944577,0.93364406,0.050122857,0.006040169,0.005848102,0.00004171486],"about_ca_topic_score_codex":0.00094352214,"about_ca_topic_score_gemma":0.001237315,"teacher_disagreement_score":0.0016474334,"about_ca_system_score_codex":0.00091491576,"about_ca_system_score_gemma":0.00075749506,"threshold_uncertainty_score":0.006638229},"labels":[],"label_agreement":null},{"id":"W2167826503","doi":"10.1109/jsac.2008.080817","title":"On the Design of Linear Transceivers for Multiuser Systems with Channel Uncertainty","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":136,"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":"Telecommunications link; Computer science; Mathematical optimization; Channel (broadcasting); Base station; Iterative method; Algorithm; Mathematics; Telecommunications","score_opus":0.054126849778311115,"score_gpt":0.26135292626820034,"score_spread":0.20722607648988922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167826503","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.002166744,0.00021857183,0.9954874,0.000104449406,0.000010766076,0.000025207668,0.000016033453,0.000040120947,0.0019308074],"genre_scores_gemma":[0.5728912,0.0021106722,0.41731638,0.0004329379,0.00021103863,0.0006732826,0.00016310732,0.00012853002,0.0060728136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979658,0.00089371495,0.000075857024,0.00032486406,0.00058239256,0.00015743323],"domain_scores_gemma":[0.99712795,0.002011897,0.00029494203,0.00015485939,0.00034396694,0.000066437526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023860433,0.0012852786,0.0012322553,0.0005456166,0.00048192687,0.001516192,0.00095311395,0.00138172,0.0022404566],"category_scores_gemma":[0.006634953,0.00072391145,0.00085546897,0.0007785922,0.0015533343,0.0014659432,0.0016476692,0.0015203499,0.000605085],"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.000023620942,0.000021537675,0.00014143765,0.00010422019,0.000028452188,0.0000533329,0.000095749434,0.94096583,0.0019452771,0.038065895,0.00043716107,0.01811738],"study_design_scores_gemma":[0.0000122166475,0.00009205113,0.00006484653,0.00002257891,0.000010642245,0.000031611446,0.000022477656,0.9777361,0.0010747323,0.019630393,0.0012876418,0.000014767616],"about_ca_topic_score_codex":0.0009782796,"about_ca_topic_score_gemma":0.0007257983,"teacher_disagreement_score":0.0023860433,"about_ca_system_score_codex":0.0010035593,"about_ca_system_score_gemma":0.0012272765,"threshold_uncertainty_score":0.01261878},"labels":[],"label_agreement":null},{"id":"W2168898252","doi":"10.1109/jsac.2010.100813","title":"Performance evaluation of UWB signal transmission over optical fiber","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 Ottawa","funders":"","keywords":"Computer science; Keying; Electronic engineering; Transmission (telecommunications); Optical fiber; Waveform; Modulation (music); SIGNAL (programming language); Pulse-position modulation; Telecommunications; Pulse-amplitude modulation; Pulse (music); Acoustics; Physics; Engineering","score_opus":0.02345877668219262,"score_gpt":0.28512099513076783,"score_spread":0.26166221844857523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168898252","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.98550665,0.00039195747,0.0121183535,0.00004616413,0.00001886099,0.000008974264,0.000045606812,0.00015598249,0.0017075061],"genre_scores_gemma":[0.9979405,0.00015401575,0.0014598581,0.0000075581092,0.000006293459,0.0000039330994,0.000042749998,0.000013407658,0.00037160073],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995639,0.00008757322,0.000024665078,0.0000489694,0.00021021093,0.00006470764],"domain_scores_gemma":[0.9982285,0.00085501425,0.00023386408,0.00010382249,0.00053834176,0.00004045781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046784416,0.00027833515,0.00027229788,0.00045466336,0.00024390165,0.00033097464,0.00027789423,0.00038509318,0.0010132095],"category_scores_gemma":[0.0019134406,0.00008557648,0.00016284833,0.0004187849,0.00019227828,0.00050575053,0.00019968438,0.00017520564,0.00019568011],"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.0022185533,0.00013755218,0.010792875,0.000418553,0.00012994409,0.0006651634,0.00044685265,0.07123523,0.82559,0.0016619667,0.00044242403,0.08626094],"study_design_scores_gemma":[0.00004516395,0.0036413637,0.016101062,0.00004948123,0.00014324262,0.0014586328,0.00026787902,0.3219541,0.6541979,0.00043037874,0.0016582344,0.00005250544],"about_ca_topic_score_codex":0.0006939774,"about_ca_topic_score_gemma":0.00023553634,"teacher_disagreement_score":0.0010132095,"about_ca_system_score_codex":0.00024496415,"about_ca_system_score_gemma":0.000109540335,"threshold_uncertainty_score":0.0033895373},"labels":[],"label_agreement":null},{"id":"W2169825920","doi":"10.1109/jsac.2007.070818","title":"Efficiency of Market-Based Resource Allocation among Many Participants","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Computer science; Probabilistic logic; Bounded function; Resource allocation; Population; Mathematical optimization; Game theory; Resource (disambiguation); Distributed computing; Computer network; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.11777898714325213,"score_gpt":0.4035614868064709,"score_spread":0.2857824996632188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169825920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19243184,0.0005023275,0.79210573,0.001088381,0.000043965763,0.00022637969,0.00010215962,0.00020621935,0.013292981],"genre_scores_gemma":[0.96499336,0.0001982558,0.030895308,0.00015499264,0.0000335337,0.00028634674,0.000054174485,0.000059676902,0.0033243357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900934,0.0059413444,0.00033022973,0.0009891145,0.0015143082,0.0011316179],"domain_scores_gemma":[0.97116673,0.020182157,0.002868185,0.0033484485,0.0016830779,0.00075145595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018008256,0.000922926,0.002264529,0.0010957217,0.001043384,0.0032650384,0.003321605,0.0026630242,0.0038414816],"category_scores_gemma":[0.03935649,0.0008740824,0.00085045554,0.0011581855,0.0031062576,0.006689929,0.0032234602,0.0012256614,0.0007429789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058308465,0.00020184889,0.0021672137,0.00017318959,0.00015949618,0.00023087124,0.00024204698,0.6670156,0.0042873486,0.29381752,0.0012547806,0.02986699],"study_design_scores_gemma":[0.00009063402,0.000111559384,0.0003661001,0.000016059352,0.00002799978,0.00011651786,0.00006964577,0.86836505,0.0014640011,0.1285882,0.00076550356,0.000018721412],"about_ca_topic_score_codex":0.0011446903,"about_ca_topic_score_gemma":0.00057455804,"teacher_disagreement_score":0.018008256,"about_ca_system_score_codex":0.002472207,"about_ca_system_score_gemma":0.0023755198,"threshold_uncertainty_score":0.09523791},"labels":[],"label_agreement":null},{"id":"W2170667309","doi":"10.1109/jsac.2007.070605","title":"Optical CDMA for All-Optical Sub-Wavelength Switching in Core GMPLS Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"graph theory and CDMA systems","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":"Label switching; Multiprotocol Label Switching; Computer science; Optical burst switching; Optical switch; Computer network; Circuit switching; Packet switching; Network packet; Throughput; Granularity; Optical Transport Network; Wavelength-division multiplexing; Topology (electrical circuits); Optical performance monitoring; Electronic engineering; Wavelength; Quality of service; Telecommunications; Optoelectronics; Materials science; Engineering","score_opus":0.037186699507115104,"score_gpt":0.2929329365543196,"score_spread":0.2557462370472045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170667309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038625754,0.0014323704,0.94536376,0.000603705,0.00008763468,0.000046530626,0.000039224364,0.00017480156,0.013626147],"genre_scores_gemma":[0.75448716,0.0016769056,0.23658524,0.00023090186,0.00007944598,0.00009982564,0.00004558728,0.00004821041,0.006746789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000055230033,0.0000037683028,0.000019687222,0.000051946343,0.000016025851],"domain_scores_gemma":[0.9996698,0.00019386271,0.000028875722,0.00003999367,0.000054844175,0.000012683824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037089718,0.00032825017,0.00019913622,0.0003612779,0.00047673192,0.0007093425,0.0003699843,0.0003495522,0.0019361492],"category_scores_gemma":[0.0010452409,0.00015398585,0.00018699211,0.00038710213,0.00048879924,0.00066970877,0.00043786774,0.0005531444,0.00028589793],"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.00012310028,0.0000660655,0.0004346871,0.00023743683,0.00002113837,0.0001469303,0.00019443283,0.16327715,0.03397742,0.6807444,0.005005745,0.115771405],"study_design_scores_gemma":[0.000016541138,0.00004311441,0.00018543605,0.000024610403,0.00001582327,0.00010901649,0.000035451118,0.84265697,0.0075664,0.14146292,0.00786852,0.000015181664],"about_ca_topic_score_codex":0.00097125076,"about_ca_topic_score_gemma":0.0024810135,"teacher_disagreement_score":0.0019361492,"about_ca_system_score_codex":0.0010114184,"about_ca_system_score_gemma":0.0009581448,"threshold_uncertainty_score":0.007338345},"labels":[],"label_agreement":null},{"id":"W2171456339","doi":"10.1109/jsac.2004.833851","title":"A Lagrangean Relaxation and Subgradient Framework for the Routing and Wavelength Assignment Problem in WDM Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"South China University of Technology; University of Waterloo","keywords":"Subgradient method; Routing and wavelength assignment; Computer science; Mathematical optimization; Lagrangian relaxation; Heuristics; Heuristic; Wavelength-division multiplexing; Routing (electronic design automation); Relaxation (psychology); Computation; Algorithm; Computer network; Wavelength; Mathematics","score_opus":0.020336621914493935,"score_gpt":0.2620670664752454,"score_spread":0.2417304445607515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171456339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010654618,0.00029006368,0.99681467,0.0002095846,0.000036794132,0.000041064046,0.000023678766,0.000044244003,0.001474486],"genre_scores_gemma":[0.090360336,0.0010158397,0.9043778,0.00019048384,0.00017724917,0.0004027182,0.00009827961,0.00009071643,0.003286495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989189,0.0006582096,0.00003288171,0.000088436514,0.00022529364,0.000076339194],"domain_scores_gemma":[0.9993831,0.0003879029,0.00006773832,0.000038149243,0.00009081825,0.000032310647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023750656,0.0014328544,0.0011522066,0.00062972435,0.0006263234,0.00093461794,0.0013219103,0.0013357678,0.0022387977],"category_scores_gemma":[0.002780778,0.0006605466,0.0009419121,0.0010457853,0.0009153294,0.001344316,0.0011189347,0.0025017252,0.0005814726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039174403,0.000063404674,0.00011189022,0.00019501688,0.000024239096,0.00007986565,0.00008485794,0.8469981,0.0014961684,0.10736655,0.0027717394,0.040768895],"study_design_scores_gemma":[0.000017364811,0.00003497877,0.00003724952,0.0000142207555,0.0000057736083,0.000021564741,0.000012343312,0.977104,0.00030621092,0.019451948,0.002987183,0.0000071419354],"about_ca_topic_score_codex":0.0059953267,"about_ca_topic_score_gemma":0.005726344,"teacher_disagreement_score":0.0059953267,"about_ca_system_score_codex":0.0013713456,"about_ca_system_score_gemma":0.0026630976,"threshold_uncertainty_score":0.012560725},"labels":[],"label_agreement":null},{"id":"W2171612010","doi":"10.1109/jsac.2005.857210","title":"Market-based self-optimization for autonomic service overlay networks","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network 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":"University of Toronto","funders":"","keywords":"Computer science; Selfishness; Computer network; Overlay network; Incentive; Distributed computing; Service (business); Multicast; Overlay; Resource allocation; Service provider; Node (physics); Optimization problem; Microeconomics; The Internet","score_opus":0.0207160599374679,"score_gpt":0.27275900646191137,"score_spread":0.2520429465244435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171612010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07351426,0.00037681227,0.9185504,0.0005227476,0.00005646468,0.00008530923,0.000032257612,0.0002129346,0.0066487766],"genre_scores_gemma":[0.9556801,0.00026119075,0.041876473,0.00004999042,0.00003143333,0.000092744885,0.000020162352,0.00002958938,0.001958348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.00020540347,0.000019212568,0.00005648224,0.0001240824,0.000060698105],"domain_scores_gemma":[0.99920267,0.00042037616,0.0001216741,0.00005942399,0.00012383511,0.00007204622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821192,0.00029590013,0.0005803337,0.0003536334,0.0005856862,0.0011410948,0.00071405695,0.0005884037,0.00134366],"category_scores_gemma":[0.002550734,0.00024549867,0.00040627725,0.0003692408,0.0010621459,0.001575692,0.00085689384,0.00065315637,0.00009934343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004278186,0.00006231436,0.00043633423,0.00004665581,0.000025205913,0.00009350907,0.00008971933,0.8460549,0.0037411528,0.13616289,0.00067735906,0.012567198],"study_design_scores_gemma":[0.0000044106987,0.000012552061,0.000038017617,0.000001485292,0.00000193526,0.0000072543226,0.000009010218,0.9847151,0.00020293597,0.014655274,0.00034929672,0.0000026907555],"about_ca_topic_score_codex":0.002451438,"about_ca_topic_score_gemma":0.0025452261,"teacher_disagreement_score":0.002451438,"about_ca_system_score_codex":0.0013243045,"about_ca_system_score_gemma":0.001183406,"threshold_uncertainty_score":0.009608567},"labels":[],"label_agreement":null},{"id":"W2171722911","doi":"10.1109/49.914513","title":"Performance of a priority-based dynamic capacity allocation scheme for wireless ATM systems","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","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":"McGill University; Concordia University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Scheduling (production processes); Real-time computing; Time division multiple access; Queue; Queueing theory; Markov process; Asynchronous Transfer Mode; Markov chain","score_opus":0.05451781948200624,"score_gpt":0.3219360821774601,"score_spread":0.2674182626954539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171722911","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.80230796,0.0012301854,0.18848358,0.0002489667,0.00019085317,0.00010222613,0.000080434416,0.0010842204,0.006271636],"genre_scores_gemma":[0.9953033,0.0000756991,0.004288683,0.0000157285,0.0000145690865,0.000010819806,0.000018337729,0.000009332897,0.0002636668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00019331732,0.000031040192,0.00005830825,0.00023363173,0.00015532032],"domain_scores_gemma":[0.99768925,0.0011801379,0.0002236179,0.00019353087,0.00055611826,0.00015741317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013863477,0.00050764676,0.0004529147,0.00068564096,0.00072065054,0.0009142003,0.0008205918,0.0005388488,0.0011375465],"category_scores_gemma":[0.0047204653,0.00018716727,0.00015860386,0.0006922026,0.00053417706,0.0006903286,0.0005544234,0.00051146775,0.00014421366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028893587,0.0005995057,0.004528899,0.00017120256,0.00009004506,0.00031546075,0.00026411327,0.68869376,0.07979982,0.016904928,0.0024204627,0.20332238],"study_design_scores_gemma":[0.00004497196,0.00026959696,0.000690574,0.000005143368,0.0000149210155,0.000072708506,0.000016565447,0.98977274,0.0075707203,0.0011636913,0.00036483945,0.000013557951],"about_ca_topic_score_codex":0.0030498046,"about_ca_topic_score_gemma":0.0013266898,"teacher_disagreement_score":0.0030498046,"about_ca_system_score_codex":0.0013232506,"about_ca_system_score_gemma":0.0007242171,"threshold_uncertainty_score":0.009600937},"labels":[],"label_agreement":null},{"id":"W2206263511","doi":"10.1109/jsac.2015.2452586","title":"Resource Allocation for Heterogeneous Applications With Device-to-Device Communication Underlaying Cellular Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Network Optimization","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cellular network; Quality of service; Resource allocation; Cellular traffic; Computer network; Distributed computing; Shared resource; Wireless; Wireless network; Resource management (computing); Heterogeneous network; Resource (disambiguation); Telecommunications","score_opus":0.035679893368485524,"score_gpt":0.27420961577958985,"score_spread":0.23852972241110432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206263511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33793053,0.0011201882,0.65230954,0.00035427435,0.00006278495,0.00007713075,0.00004904109,0.0001356195,0.007960906],"genre_scores_gemma":[0.98986256,0.00020466499,0.00898912,0.000025336836,0.000015476699,0.00002695732,0.000009996483,0.000009036358,0.0008569519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996344,0.00011857576,0.000009823485,0.000052887226,0.00006443041,0.00011988588],"domain_scores_gemma":[0.9997563,0.00013314573,0.000036797774,0.000016637036,0.00003152401,0.000025482463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872221,0.00075114425,0.00056776684,0.0002587711,0.0006005418,0.0008842903,0.0006236263,0.0005263441,0.00070736656],"category_scores_gemma":[0.0009893441,0.00017993069,0.00031227386,0.00047660831,0.0004365104,0.0005817586,0.0009047135,0.00038871163,0.00008071485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043028864,0.00002230061,0.00050128927,0.000017323566,0.00001790893,0.00011508995,0.00003224127,0.9852507,0.0027670732,0.0038336967,0.0002287087,0.0071705575],"study_design_scores_gemma":[0.0000028335219,0.000014266559,0.00013418366,9.472121e-7,0.000005057604,0.00001423264,0.000016559066,0.9982931,0.0002768837,0.0010660075,0.00017391703,0.0000019809922],"about_ca_topic_score_codex":0.0054066614,"about_ca_topic_score_gemma":0.00478363,"teacher_disagreement_score":0.0054066614,"about_ca_system_score_codex":0.0008341355,"about_ca_system_score_gemma":0.00056653755,"threshold_uncertainty_score":0.010750353},"labels":[],"label_agreement":null},{"id":"W2226827734","doi":"10.1109/jsac.2016.2544459","title":"Energy Efficiency of Downlink Transmission Strategies for Cloud Radio Access Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":249,"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":"Computer science; Telecommunications link; Backhaul (telecommunications); C-RAN; Transmitter power output; Base station; Radio access network; Efficient energy use; Computer network; Beamforming; Transmission (telecommunications); User equipment; Energy consumption; Optimization problem; Cellular network; Data transmission; Power optimization; Power (physics); Transmitter; Telecommunications; Algorithm; Mobile station; Power consumption; Electrical engineering","score_opus":0.023397208338869904,"score_gpt":0.2865503854197243,"score_spread":0.2631531770808544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226827734","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.15772133,0.0017537795,0.82233596,0.00036432166,0.000050952538,0.00010828457,0.00006486985,0.00017232238,0.017428132],"genre_scores_gemma":[0.95888174,0.0005361551,0.03905941,0.00006694806,0.000022156857,0.00003750682,0.000033256656,0.000037310318,0.0013254674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938035,0.00022286971,0.00002207273,0.00005795829,0.00018143404,0.00013536152],"domain_scores_gemma":[0.99882025,0.00082839525,0.00010439988,0.00006880277,0.00015153762,0.000026578018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011711473,0.00074314675,0.0005785597,0.00044177525,0.00043159758,0.00096999825,0.00070689485,0.0004880983,0.0014618628],"category_scores_gemma":[0.0031135208,0.00018639684,0.00025193414,0.00071769144,0.0006440992,0.00096323073,0.00062256836,0.00045659742,0.00018549724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016405496,0.00007637898,0.00059998705,0.000057680772,0.00001848539,0.000046881974,0.00002717127,0.9308794,0.004756244,0.018127661,0.00039271396,0.04485337],"study_design_scores_gemma":[0.000006880329,0.000034667657,0.00013828765,0.000004791339,0.000007004024,0.000017792037,0.000018028411,0.9949057,0.002160931,0.002499822,0.00020275061,0.0000033277315],"about_ca_topic_score_codex":0.004866528,"about_ca_topic_score_gemma":0.0047042915,"teacher_disagreement_score":0.004866528,"about_ca_system_score_codex":0.0012678276,"about_ca_system_score_gemma":0.0010207556,"threshold_uncertainty_score":0.009676456},"labels":[],"label_agreement":null},{"id":"W2230831824","doi":"10.1109/jsac.2015.2504299","title":"Fast List Decoders for Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":153,"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; McGill University","funders":"University of California, San Diego; École Polytechnique Fédérale de Lausanne; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Center for Advanced Study, University of Illinois at Urbana-Champaign; David and Lucile Packard Foundation; National Science Foundation","keywords":"Decoding methods; List decoding; Polar code; Sequential decoding; Concatenated error correction code; Low-density parity-check code; Berlekamp–Welch algorithm; Code (set theory)","score_opus":0.0810445107494296,"score_gpt":0.3521803789829451,"score_spread":0.2711358682335155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230831824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014271933,0.0005084407,0.97675574,0.00017615788,0.00012306296,0.00008962135,0.00014774881,0.0027136991,0.005213575],"genre_scores_gemma":[0.16991785,0.0007682266,0.8189715,0.00023818259,0.00013248921,0.0001995651,0.0005673845,0.0003098424,0.0088949725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00010113148,0.00004498982,0.000056679703,0.00024231254,0.000060150465],"domain_scores_gemma":[0.9979323,0.0008217864,0.000223599,0.00026981297,0.0006945596,0.000057960588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059173827,0.0006772217,0.0004248593,0.0013377799,0.00080253195,0.0013822437,0.0007138777,0.0007190072,0.004649034],"category_scores_gemma":[0.0037343754,0.00028545616,0.00033569336,0.001137896,0.00053130905,0.001401032,0.0011252423,0.0009403524,0.0033423144],"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.0008366941,0.00012668523,0.0015708383,0.00046331095,0.000051198203,0.00036525328,0.00043675012,0.11041067,0.093272336,0.11921126,0.01193561,0.6613194],"study_design_scores_gemma":[0.00016729975,0.0003441999,0.00046784364,0.00013104074,0.00004912415,0.0005308187,0.00010542601,0.7557401,0.17072286,0.042144977,0.029498294,0.00009793797],"about_ca_topic_score_codex":0.0015385016,"about_ca_topic_score_gemma":0.002646163,"teacher_disagreement_score":0.004649034,"about_ca_system_score_codex":0.00072856754,"about_ca_system_score_gemma":0.0015273591,"threshold_uncertainty_score":0.01555258},"labels":[],"label_agreement":null},{"id":"W2237949559","doi":"10.1109/jsac.2016.2520244","title":"Energy-Aware Traffic Offloading for Green Heterogeneous Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":150,"is_retracted":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 Key Research and Development Program of China; National Science Foundation","keywords":"Heterogeneous network; Base station; Quality of service; Cellular network; Efficient energy use; Macro; Power control; Cellular traffic","score_opus":0.022921012387597597,"score_gpt":0.24701392906651873,"score_spread":0.22409291667892112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237949559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20614119,0.00039270622,0.7875728,0.00014926301,0.00006227373,0.000051582738,0.000057798858,0.0003220919,0.0052502616],"genre_scores_gemma":[0.988526,0.00009684339,0.010639814,0.000029866513,0.000012762126,0.00001603302,0.000026758793,0.000011540445,0.00064046175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980265,0.000043299973,0.0000059094173,0.000037210473,0.000050916933,0.000059962837],"domain_scores_gemma":[0.9997398,0.00011842936,0.00003342464,0.000041871033,0.000040559193,0.000025939844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028790208,0.0005088836,0.00038241417,0.0003432915,0.00045065355,0.00049613405,0.00053448626,0.0002852649,0.00062170945],"category_scores_gemma":[0.0006956222,0.00014983583,0.00026679842,0.0004372623,0.00036052646,0.0005074075,0.00057056936,0.00028347765,0.00010466268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034457922,0.00015929392,0.0019110048,0.00008177889,0.00004692948,0.00038425895,0.00012367866,0.74531376,0.07732283,0.017229993,0.0013670411,0.15571478],"study_design_scores_gemma":[0.0000062419817,0.000026640852,0.00030782638,0.0000026352723,0.000008352942,0.00003096367,0.00002648205,0.99158716,0.003546532,0.004030563,0.00042161884,0.000005054559],"about_ca_topic_score_codex":0.0022513908,"about_ca_topic_score_gemma":0.0053831534,"teacher_disagreement_score":0.0022513908,"about_ca_system_score_codex":0.00068451406,"about_ca_system_score_gemma":0.00041927383,"threshold_uncertainty_score":0.0049664974},"labels":[],"label_agreement":null},{"id":"W2294456571","doi":"10.1109/jsac.2016.2525538","title":"Molecular MIMO: From Theory to Prototype","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":221,"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":"Ministry of Science ICT and Future Planning; National Research Foundation of Korea","keywords":"Molecular communication; Intersymbol interference; Computer science; MIMO; Transmitter; Channel (broadcasting); Channel state information; Interference (communication); Impulse response; Electronic engineering; Algorithm; Communications system; Detection theory; Telecommunications; Detector; Wireless; Mathematics","score_opus":0.017103894763872817,"score_gpt":0.25981299202746694,"score_spread":0.24270909726359413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294456571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106986845,0.004187704,0.944825,0.00069937116,0.00029409333,0.00007869824,0.00013456373,0.00041771613,0.038664155],"genre_scores_gemma":[0.6180847,0.009750175,0.34955272,0.00077037024,0.00075349555,0.0003754499,0.00030572366,0.000117566,0.020289915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996301,0.00011394758,0.000012431338,0.000041316413,0.00016085268,0.00004138507],"domain_scores_gemma":[0.99941266,0.00031091328,0.000042384712,0.00009013273,0.000116089424,0.000027837239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088548,0.0004086901,0.0005738942,0.00042175237,0.00030228758,0.001413608,0.00075347594,0.0007792193,0.0034171427],"category_scores_gemma":[0.001453707,0.00027240824,0.000408606,0.0005204612,0.0008047316,0.0010110427,0.0006920673,0.0010861373,0.0011438766],"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.00012056192,0.000108316905,0.0007775223,0.000476548,0.00005214726,0.0002515803,0.00019516314,0.31429595,0.013100886,0.566151,0.007314317,0.097155936],"study_design_scores_gemma":[0.00001988815,0.00018089649,0.00020724462,0.00007239334,0.000017331144,0.00029332534,0.000044177894,0.8888788,0.0047532236,0.088302284,0.01719637,0.000034017037],"about_ca_topic_score_codex":0.00065416895,"about_ca_topic_score_gemma":0.000507428,"teacher_disagreement_score":0.0034171427,"about_ca_system_score_codex":0.000618788,"about_ca_system_score_gemma":0.00044400265,"threshold_uncertainty_score":0.011431456},"labels":[],"label_agreement":null},{"id":"W2315397662","doi":"10.1109/jsac.2016.2545380","title":"Design, Analysis, and Hardware Emulation of a Novel Energy Conservation Scheme for Sensor Enhanced FiWi Networks (ECO-SFiWi)","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Photonic Communication 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Wireless sensor network; Emulation; Computer network; Efficient energy use; Wireless; Passive optical network; Time division multiple access; Energy consumption; Key distribution in wireless sensor networks; Real-time computing; Embedded system; Wireless network; Telecommunications; Engineering; Electrical engineering","score_opus":0.040841251986956435,"score_gpt":0.2874975835269392,"score_spread":0.2466563315399828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315397662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16981053,0.00038740627,0.81728977,0.00031780492,0.00012286827,0.000329249,0.00009422775,0.0015411258,0.010107052],"genre_scores_gemma":[0.9012798,0.00018674858,0.09585037,0.00006114768,0.000015542884,0.00011608894,0.00008715115,0.000046603738,0.0023564172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978095,0.000037034497,0.000009338852,0.000032582244,0.00010818241,0.000031871277],"domain_scores_gemma":[0.99972683,0.000071190814,0.000052246698,0.00003931898,0.00009370717,0.000016748267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004343412,0.00045264667,0.00022551694,0.00024508307,0.00020604963,0.0004176091,0.0009843038,0.00028871736,0.0012166788],"category_scores_gemma":[0.0005161879,0.00013760672,0.0002600374,0.00015422891,0.00024770736,0.0005211731,0.00020280124,0.00038433296,0.00020543249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044412477,0.00036334814,0.0043716775,0.00046848974,0.00012895183,0.00035750074,0.00025063538,0.56059957,0.23045409,0.024569403,0.0035437075,0.17444853],"study_design_scores_gemma":[0.000023094015,0.00042734755,0.0004885552,0.000010454355,0.000019168669,0.00008506738,0.00001686883,0.9513288,0.043678824,0.00044516815,0.0034650527,0.000011575736],"about_ca_topic_score_codex":0.0015765505,"about_ca_topic_score_gemma":0.0017531911,"teacher_disagreement_score":0.0015765505,"about_ca_system_score_codex":0.0007597708,"about_ca_system_score_gemma":0.0006413271,"threshold_uncertainty_score":0.0055125356},"labels":[],"label_agreement":null},{"id":"W2329630841","doi":"10.1109/jsac.2016.2545358","title":"Joint Chance-Constrained Predictive Resource Allocation for Energy-Efficient Video Streaming","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Royal Military College of Canada; Cisco Systems (Canada); Queen's University","funders":"","keywords":"Computer science; Quality of service; Mathematical optimization; Efficient energy use; Probabilistic logic; Robustness (evolution); Resource allocation; Exploit; Time horizon; Train; Base station; Real-time computing; Distributed computing; Computer network; Artificial intelligence","score_opus":0.020401491521633845,"score_gpt":0.24815629687923235,"score_spread":0.2277548053575985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329630841","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.018889427,0.00037653575,0.97730106,0.00019304678,0.000035011024,0.000034939574,0.000047257017,0.00014031441,0.0029823806],"genre_scores_gemma":[0.91464937,0.00040744475,0.08152147,0.00010940645,0.00005817114,0.000110430694,0.00007775196,0.00006000773,0.00300596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996891,0.00009942276,0.000011563038,0.000048407397,0.000084688574,0.000066778135],"domain_scores_gemma":[0.9994087,0.00041565564,0.000060119426,0.0000199548,0.0000636541,0.000031894553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007226294,0.00069107016,0.0007621592,0.00028316054,0.0002682968,0.0006925684,0.00094442064,0.00059987453,0.0016814907],"category_scores_gemma":[0.0017227518,0.00042647694,0.00039187065,0.00058914616,0.0005660027,0.00063620607,0.00063283043,0.0009344523,0.00014719802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028397013,0.0000128469,0.00009495734,0.000019427694,0.000009213052,0.000025727846,0.000013931673,0.9857961,0.0005323123,0.0057361578,0.0003481985,0.00738282],"study_design_scores_gemma":[0.0000020376708,0.000006199773,0.000019284214,0.0000014219498,0.0000013464934,0.0000028518398,0.000002230214,0.9984139,0.00009235728,0.0013810571,0.00007579669,0.0000013918335],"about_ca_topic_score_codex":0.006251577,"about_ca_topic_score_gemma":0.005988797,"teacher_disagreement_score":0.006251577,"about_ca_system_score_codex":0.0007849614,"about_ca_system_score_gemma":0.0012555551,"threshold_uncertainty_score":0.01243037},"labels":[],"label_agreement":null},{"id":"W2335056529","doi":"10.1109/jsac.2016.2551538","title":"Self-Sustainable Communications With RF Energy Harvesting: Ginibre Point Process Modeling and Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","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":"Ministry of Education, India; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Energy harvesting; Fading; Computer science; Radio frequency; Transmission (telecommunications); Stochastic geometry; Transmitter; Wireless; Energy (signal processing); Cognitive radio; Telecommunications link; Telecommunications; Nakagami distribution; Electronic engineering; Topology (electrical circuits); Computer network; Electrical engineering; Mathematics; Engineering; Channel (broadcasting); Statistics","score_opus":0.015960906537122843,"score_gpt":0.24553089941924494,"score_spread":0.2295699928821221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335056529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058635317,0.0011882832,0.9254463,0.00089210365,0.000077934084,0.00004638362,0.000119276054,0.00011312653,0.013481281],"genre_scores_gemma":[0.9600717,0.002077767,0.027494825,0.00023728822,0.000084281804,0.00014012108,0.00013357152,0.000079943486,0.009680472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997652,0.000079054436,0.0000075274775,0.00003165969,0.00007381457,0.00004280093],"domain_scores_gemma":[0.9993961,0.00031121634,0.00008574813,0.00003526464,0.00012537373,0.00004637289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080247654,0.00065699435,0.0006758438,0.0005939054,0.00033736776,0.001147847,0.0010195174,0.00127141,0.0013142938],"category_scores_gemma":[0.0018881328,0.00031167097,0.0008731643,0.0006207376,0.0013173247,0.0011224145,0.000885062,0.0011610355,0.0003344045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015791156,0.000023010336,0.0007508102,0.00004368569,0.000022713215,0.00014306375,0.00011918205,0.76724625,0.0022418431,0.2261098,0.00062150613,0.002662355],"study_design_scores_gemma":[0.0000018809301,0.000004025011,0.000062610285,0.0000027717922,0.000002055241,0.000012886817,0.000009256735,0.98566544,0.00008167237,0.013915043,0.00023837284,0.0000040820296],"about_ca_topic_score_codex":0.0047231815,"about_ca_topic_score_gemma":0.0016161442,"teacher_disagreement_score":0.0047231815,"about_ca_system_score_codex":0.0010000613,"about_ca_system_score_gemma":0.0006993598,"threshold_uncertainty_score":0.009391427},"labels":[],"label_agreement":null},{"id":"W2344619542","doi":"10.1109/jsac.2016.2520245","title":"Greener Data Exchange in the Cloud: A Coding-Based Optimization for Big Data Processing","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of Toronto","funders":"","keywords":"Computer science; Goodput; Cloud computing; Big data; Distributed computing; Data center; Volume (thermodynamics); Data exchange; Computer network; Database; Data mining; Operating system; Wireless","score_opus":0.27241760672678594,"score_gpt":0.3708167054825921,"score_spread":0.09839909875580616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344619542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03746476,0.00023511791,0.95807624,0.00035973295,0.000046626057,0.00005489556,0.000033445736,0.00020432036,0.003524864],"genre_scores_gemma":[0.7634881,0.00027820078,0.23276888,0.00016917862,0.000056815254,0.00010581679,0.000071798335,0.00010653226,0.0029547373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960893,0.00009766148,0.000010968313,0.00005623255,0.00016401986,0.000062222156],"domain_scores_gemma":[0.9991393,0.00047748612,0.00010237035,0.000073385236,0.00014240514,0.00006499922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074649265,0.00052499527,0.000487485,0.00035455852,0.00046958934,0.00081915775,0.00084735744,0.00062802725,0.0011460913],"category_scores_gemma":[0.0019179811,0.00021933914,0.00035163484,0.00067233935,0.0010995766,0.0013560466,0.0010645827,0.0008683731,0.00017010079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824186,0.00007481284,0.00037317094,0.00006191363,0.00002116671,0.00005371025,0.000068878966,0.9224315,0.012363459,0.031759582,0.0011477697,0.031525813],"study_design_scores_gemma":[0.000003991061,0.00001460205,0.000027135746,0.000002223064,0.0000017190207,0.000006051969,0.0000063483035,0.99505544,0.000998324,0.0036489815,0.00023223199,0.0000030385652],"about_ca_topic_score_codex":0.0026980797,"about_ca_topic_score_gemma":0.0025298381,"teacher_disagreement_score":0.0026980797,"about_ca_system_score_codex":0.0010223751,"about_ca_system_score_gemma":0.0015884322,"threshold_uncertainty_score":0.0074178576},"labels":[],"label_agreement":null},{"id":"W2344785668","doi":"10.1109/jsac.2016.2520181","title":"Maximizing Network Utility of Rechargeable Sensor Networks With Spatiotemporally Coupled Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":88,"is_retracted":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; Battery (electricity); Context (archaeology); Constraint (computer-aided design); Mathematical optimization; Dual (grammatical number); Utility maximization problem; Maximization; Distributed computing; Utility maximization; Power (physics)","score_opus":0.025217864619591197,"score_gpt":0.23752502234887085,"score_spread":0.21230715772927966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344785668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061629124,0.0008303975,0.93222606,0.0003547086,0.000033464923,0.000056134508,0.00009045056,0.00010628479,0.0046733967],"genre_scores_gemma":[0.94205874,0.00072155334,0.054050226,0.00009897699,0.000029154264,0.00010510063,0.00010073826,0.00006536111,0.0027702125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958855,0.00017851651,0.000013939369,0.000078545876,0.00007460499,0.000065849286],"domain_scores_gemma":[0.99930394,0.00047726452,0.00007995238,0.00003125315,0.00007067754,0.00003697343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010021238,0.0011517116,0.0011368077,0.00038619392,0.0003314878,0.0010760075,0.0011995238,0.0008028418,0.0012713894],"category_scores_gemma":[0.0026557446,0.00044765606,0.00043753895,0.0008980545,0.00067510677,0.0017612033,0.0011247729,0.0006611701,0.00013862226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000481277,0.000020585421,0.000271054,0.000067331646,0.000022183238,0.00007094109,0.00003371217,0.97835714,0.0013074538,0.009774785,0.0003689848,0.009657661],"study_design_scores_gemma":[0.000004862143,0.00001392757,0.000058279176,0.000003685223,0.000005235176,0.000012630686,0.000014485129,0.9947595,0.00030663487,0.004634981,0.00018326758,0.0000024841306],"about_ca_topic_score_codex":0.002814748,"about_ca_topic_score_gemma":0.0025732534,"teacher_disagreement_score":0.002814748,"about_ca_system_score_codex":0.0011876684,"about_ca_system_score_gemma":0.00079036586,"threshold_uncertainty_score":0.008617163},"labels":[],"label_agreement":null},{"id":"W2415153062","doi":"10.1109/jsac.2016.2577219","title":"WhiteFi Infostation: Engineering Vehicular Media Streaming With Geolocation Database","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Geolocation; Database; Multimedia; Computer network; World Wide Web","score_opus":0.012645762409435298,"score_gpt":0.2198015512667703,"score_spread":0.20715578885733502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415153062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018939935,0.00022790296,0.9702805,0.00017707341,0.00009046819,0.00015454812,0.00021240946,0.0026124658,0.0073046754],"genre_scores_gemma":[0.49310142,0.0008145678,0.49424022,0.00015949353,0.00015549382,0.00024718017,0.0010294892,0.00039605197,0.00985601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999744,0.000036942827,0.000015924072,0.000052589927,0.000118991156,0.000031557644],"domain_scores_gemma":[0.9996592,0.000095784846,0.00005002441,0.000090090674,0.00006906991,0.00003580434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035589738,0.00048306148,0.00028746735,0.00041181117,0.0002730367,0.00076198636,0.0011090713,0.0005348626,0.0023483369],"category_scores_gemma":[0.0012101717,0.00024302954,0.0002761537,0.0004666732,0.00026416255,0.0008402962,0.0009437729,0.00056561764,0.00078970037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018917331,0.00016477505,0.0032380628,0.00028821177,0.000055366905,0.0006996386,0.00019302533,0.44455826,0.06953165,0.05123604,0.01534731,0.41449845],"study_design_scores_gemma":[0.000020839976,0.000085869906,0.00039246475,0.00001546007,0.000010890326,0.0002548445,0.000042572177,0.95639825,0.01587173,0.0052241622,0.021668877,0.000014091476],"about_ca_topic_score_codex":0.0020641545,"about_ca_topic_score_gemma":0.0023376688,"teacher_disagreement_score":0.0023483369,"about_ca_system_score_codex":0.0003468324,"about_ca_system_score_gemma":0.0006959401,"threshold_uncertainty_score":0.007855952},"labels":[],"label_agreement":null},{"id":"W2507866784","doi":"10.1109/jsac.2016.2606818","title":"VERACITY: Overlapping Coalition Formation-Based Double Auction for Heterogeneous Demand and Spectrum Reusability","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Spectrum auction; Double auction; Outcome (game theory); Frequency allocation; Convergence (economics); Resource allocation; Auction algorithm; Auction theory; Microeconomics; Revenue equivalence; Common value auction; Economics; Computer network","score_opus":0.1234145194696224,"score_gpt":0.3873974884820771,"score_spread":0.2639829690124547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507866784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044996716,0.00025933448,0.9484095,0.000219557,0.00007248525,0.00013912968,0.0000550431,0.00020756335,0.0056406776],"genre_scores_gemma":[0.93039894,0.0001611436,0.06617557,0.00009257971,0.000031188123,0.00012485447,0.000081995655,0.000033682285,0.0028999778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716944,0.0010868052,0.00013301442,0.0004697027,0.00071571616,0.0004252858],"domain_scores_gemma":[0.9974444,0.0011806638,0.00039132158,0.00034779744,0.0003672944,0.00026848726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031664048,0.00090968027,0.0014428111,0.00069399585,0.0008137131,0.0021532797,0.0027553246,0.0011613645,0.0019285502],"category_scores_gemma":[0.0067932643,0.00049918494,0.00090224977,0.0011726611,0.0012944359,0.0026843345,0.0025662284,0.0012705245,0.0002497792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003634344,0.00018937387,0.0014065679,0.00015474741,0.00013040933,0.0005675557,0.0002531431,0.84652394,0.0065427953,0.08819702,0.0018371881,0.05383376],"study_design_scores_gemma":[0.00003769023,0.000072007846,0.00009957687,0.0000059119757,0.000015596272,0.00013153264,0.000030385132,0.9818382,0.00063522824,0.016385075,0.00073495397,0.000013925105],"about_ca_topic_score_codex":0.0023222442,"about_ca_topic_score_gemma":0.0017253902,"teacher_disagreement_score":0.0031664048,"about_ca_system_score_codex":0.0012392298,"about_ca_system_score_gemma":0.0016777448,"threshold_uncertainty_score":0.016745746},"labels":[],"label_agreement":null},{"id":"W2514892827","doi":"10.1109/jsac.2016.2600338","title":"Optimal Stochastic Power Control for Energy Harvesting Systems With Delay Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fading; Markov decision process; Mathematical optimization; Power control; Queue; Channel (broadcasting); Reinforcement learning; Control theory (sociology); Queuing delay; Markov process; Power (physics); Mathematics; Control (management); Computer network","score_opus":0.015468949429643587,"score_gpt":0.23345669445840095,"score_spread":0.21798774502875737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514892827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03892574,0.00078558846,0.9564561,0.00039437937,0.00006456059,0.00004783673,0.00007114898,0.00014540549,0.0031092041],"genre_scores_gemma":[0.98323107,0.00052879273,0.013263786,0.000087085835,0.000044520468,0.0000942992,0.000062437015,0.00003330466,0.0026546386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999169,0.00022104156,0.00004219561,0.00021754531,0.00016606195,0.00018426526],"domain_scores_gemma":[0.9973936,0.0018837128,0.00034120205,0.00006393973,0.00024102752,0.000076530734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014750431,0.0013419592,0.0013545564,0.00045316,0.00044175185,0.0014085377,0.0009746765,0.00094091834,0.0014725415],"category_scores_gemma":[0.00450859,0.00067802146,0.00061480846,0.0007047474,0.0013222169,0.0011114379,0.0011520896,0.0013591141,0.00015887585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033115113,0.00001649237,0.00014817959,0.00003619959,0.000014142745,0.000038918206,0.000025795538,0.9867003,0.0005944919,0.008255655,0.00015810382,0.0039786184],"study_design_scores_gemma":[0.0000066613406,0.000013278052,0.000038017,0.0000023198481,0.000003455301,0.0000037589623,0.00000359265,0.99727505,0.00009296182,0.0024852727,0.000072941104,0.0000026535092],"about_ca_topic_score_codex":0.008366006,"about_ca_topic_score_gemma":0.004469744,"teacher_disagreement_score":0.008366006,"about_ca_system_score_codex":0.0016454487,"about_ca_system_score_gemma":0.0015486084,"threshold_uncertainty_score":0.016634643},"labels":[],"label_agreement":null},{"id":"W2521375007","doi":"10.1109/jsac.2016.2611979","title":"Secrecy-Based Energy-Efficient Data Offloading via Dual Connectivity Over Unlicensed Spectrums","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","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":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Secrecy; Dual (grammatical number); Computer security","score_opus":0.03865880970438533,"score_gpt":0.28795919812453746,"score_spread":0.24930038842015212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521375007","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.11907794,0.00023258664,0.8732179,0.00017082496,0.000051276773,0.00003762872,0.000061967425,0.00026937816,0.006880436],"genre_scores_gemma":[0.94759464,0.00014356922,0.05072769,0.000046495694,0.000017660486,0.00004047595,0.000059171613,0.000024912168,0.0013454803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996624,0.00008619204,0.000013324215,0.000051974977,0.00009830551,0.00008780942],"domain_scores_gemma":[0.9996025,0.00019274456,0.00005677373,0.00005594014,0.00005552742,0.000036607737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033812993,0.00053712353,0.00053484045,0.00036796276,0.00035346337,0.0007886017,0.00059359556,0.00047342296,0.0014143182],"category_scores_gemma":[0.0010415869,0.0002169698,0.00042278005,0.0005006481,0.00053386326,0.0007406655,0.0010343051,0.0005128554,0.000292456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022529886,0.00009367888,0.00095324736,0.00008318864,0.000022955379,0.00025049047,0.00012244475,0.8974343,0.022818733,0.023544818,0.0012225467,0.053228293],"study_design_scores_gemma":[0.000005489403,0.000021910068,0.00007026885,0.0000024461813,0.0000027986346,0.000023800645,0.000011937395,0.9955505,0.0015098228,0.002590161,0.00020679849,0.000004072968],"about_ca_topic_score_codex":0.0009307593,"about_ca_topic_score_gemma":0.0011335339,"teacher_disagreement_score":0.0014143182,"about_ca_system_score_codex":0.00038525456,"about_ca_system_score_gemma":0.00043153195,"threshold_uncertainty_score":0.0047314167},"labels":[],"label_agreement":null},{"id":"W2527982577","doi":"10.1109/jsac.2016.2603663","title":"Mitigation of Inter-Cell Interference in Flash Memory With Capacity-Approaching Variable-Length Constrained Sequence Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Storage Technologies","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":"University of Alberta","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Computer science; Flash memory; Sequence (biology); Algorithm; Interference (communication); Constraint (computer-aided design); Computer hardware; Telecommunications; Mathematics","score_opus":0.04302865943478798,"score_gpt":0.27316601394612766,"score_spread":0.23013735451133968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527982577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28216866,0.0006026363,0.7114766,0.00020511901,0.00004040601,0.000041379204,0.000049882015,0.00029854177,0.00511674],"genre_scores_gemma":[0.9360136,0.00019418614,0.062591165,0.00007521796,0.000016807757,0.000043663,0.000032976386,0.000016014705,0.0010164037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984527,0.00003573533,0.00000992111,0.0000187379,0.00006880379,0.000021533073],"domain_scores_gemma":[0.9994265,0.00023704804,0.00008736767,0.000080039164,0.00014763832,0.000021570411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002293302,0.00029214224,0.00021032423,0.00017409323,0.00017692843,0.0003075662,0.0005837287,0.0002707263,0.00060987583],"category_scores_gemma":[0.0010704467,0.00009796891,0.0001152123,0.00028068744,0.00038061987,0.00071345223,0.00040017534,0.00032591398,0.00010626965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002672115,0.00010546093,0.0015446097,0.0001796937,0.00005366973,0.00032678669,0.00019832281,0.664742,0.15566802,0.06861226,0.0009809217,0.10732102],"study_design_scores_gemma":[0.000015308926,0.00018457208,0.0002024649,0.000017544342,0.000010214802,0.00009085359,0.000027909913,0.9350601,0.05421409,0.008935586,0.0012238676,0.000017418104],"about_ca_topic_score_codex":0.0007898799,"about_ca_topic_score_gemma":0.0011838913,"teacher_disagreement_score":0.0007898799,"about_ca_system_score_codex":0.00026928112,"about_ca_system_score_gemma":0.00038886804,"threshold_uncertainty_score":0.0020402074},"labels":[],"label_agreement":null},{"id":"W2528584088","doi":"10.1109/jsac.2016.2615261","title":"Secure Transmission in Cognitive Satellite Terrestrial Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":376,"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":"China Postdoctoral Science Foundation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Channel state information; Telecommunications link; Transmission (telecommunications); Beamforming; Base station; Satellite; Computer network; Interference (communication); Optimization problem; Channel (broadcasting); Telecommunications; Wireless; Algorithm","score_opus":0.04276695135308052,"score_gpt":0.294104844381964,"score_spread":0.2513378930288835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528584088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122892804,0.0010474195,0.86607826,0.00033069562,0.000048260805,0.00003289896,0.000062578256,0.00017507808,0.009332077],"genre_scores_gemma":[0.98148674,0.00052695686,0.016811067,0.000063990556,0.000026544183,0.00002990158,0.00002421462,0.000008217721,0.0010223954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999335,0.00021358194,0.000018498848,0.00007154003,0.00021453404,0.00014685237],"domain_scores_gemma":[0.99892575,0.00072229584,0.00013670111,0.0000697159,0.00011558997,0.000029858591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008235352,0.0006291386,0.00043998615,0.0004317134,0.0005380538,0.0008360365,0.0005461586,0.00057690777,0.00083177467],"category_scores_gemma":[0.0022932289,0.00022106811,0.0003581837,0.0007869547,0.0012051293,0.00079200004,0.0010846184,0.00046057184,0.00014726976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022087072,0.00003394888,0.0010965915,0.00015800084,0.000054499316,0.00047922577,0.0001958408,0.8828745,0.010325633,0.06789309,0.00075804937,0.035909764],"study_design_scores_gemma":[0.000015824458,0.00006131936,0.000227798,0.000011792981,0.000018534944,0.00010213331,0.000060626186,0.9826142,0.002318664,0.013876851,0.0006804869,0.00001179017],"about_ca_topic_score_codex":0.0035940295,"about_ca_topic_score_gemma":0.003087532,"teacher_disagreement_score":0.0035940295,"about_ca_system_score_codex":0.0008765888,"about_ca_system_score_gemma":0.00085378974,"threshold_uncertainty_score":0.0071462393},"labels":[],"label_agreement":null},{"id":"W2546306028","doi":"10.1109/jsac.2016.2621618","title":"Toward Energy-Efficient and Robust Large-Scale WSNs: A Scale-Free Network Approach","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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 Waterloo","funders":"China Scholarship Council; Kuwait Foundation for the Advancement of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Robustness (evolution); Computer science; Wireless sensor network; Efficient energy use; Distributed computing; Network topology; Software deployment; Scale-free network; Cluster analysis; Topology (electrical circuits); Computer network; Complex network; Artificial intelligence; Mathematics; Engineering","score_opus":0.028599924183470304,"score_gpt":0.239385623856787,"score_spread":0.2107856996733167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546306028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011752499,0.00046471792,0.9854452,0.00028661804,0.000032380456,0.000033969267,0.000013973676,0.00012413456,0.0018464712],"genre_scores_gemma":[0.7311102,0.0018837639,0.26251832,0.00025294637,0.00013251172,0.00020010544,0.00007301854,0.00010102548,0.0037281602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969304,0.000077157805,0.000013278538,0.00006870919,0.0001269974,0.00002084438],"domain_scores_gemma":[0.9994942,0.00019243495,0.00009591894,0.00009556467,0.000085691565,0.000036262885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682062,0.0005321312,0.00047638937,0.00061115914,0.00044859925,0.0008173691,0.0015495443,0.0007025107,0.0005768965],"category_scores_gemma":[0.0014161,0.00029605022,0.00052313827,0.0006008329,0.0009103861,0.0019326959,0.0014044116,0.00065032794,0.00017611799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003862954,0.000053661937,0.0007543153,0.00018154085,0.00008452487,0.00019199401,0.00017685833,0.81759804,0.02234609,0.0991248,0.0014056198,0.05804395],"study_design_scores_gemma":[0.000007549849,0.000033842694,0.00016199057,0.0000063906436,0.00001578827,0.000057401485,0.000028932645,0.9692616,0.0017102461,0.026664201,0.0020405494,0.000011497554],"about_ca_topic_score_codex":0.00077519374,"about_ca_topic_score_gemma":0.000827768,"teacher_disagreement_score":0.0015495443,"about_ca_system_score_codex":0.0006427722,"about_ca_system_score_gemma":0.00040335406,"threshold_uncertainty_score":0.004663706},"labels":[],"label_agreement":null},{"id":"W2558073332","doi":"10.1109/jsac.2016.2633039","title":"Small-Macro Cell Cooperation for HetNet Uplink Transmission: Spectral Efficiency and Reliability Analyses","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of Alberta","funders":"","keywords":"Computer science; Spectral efficiency; Transmission (telecommunications); Telecommunications link; Decoding methods; Macro; Heterogeneous network; User equipment; Fading; Base station; Cellular network; Computer network; Relay; Small cell; Algorithm; Channel (broadcasting); Wireless network; Telecommunications; Wireless; Power (physics)","score_opus":0.09039897798359212,"score_gpt":0.34549365051688535,"score_spread":0.2550946725332932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558073332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2506412,0.0024017994,0.729514,0.00049497397,0.000049315455,0.00007792587,0.0001524433,0.0001952889,0.016473062],"genre_scores_gemma":[0.9878911,0.00072261924,0.0102397185,0.000048337388,0.000028002572,0.000043131673,0.00004391057,0.000025046109,0.00095809094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.00029922338,0.000015942707,0.00004699462,0.00015031325,0.00011217229],"domain_scores_gemma":[0.9952903,0.0033428636,0.00034688454,0.00023518973,0.00070217025,0.000082545346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022406697,0.00080834544,0.000664745,0.0007413663,0.0004222196,0.00074856065,0.000715971,0.0006092884,0.0017524086],"category_scores_gemma":[0.0058160652,0.0002561732,0.00051668484,0.00071409706,0.0010477,0.00089784904,0.0008949703,0.00049048953,0.00027676995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100435456,0.000049888386,0.0017657821,0.00009656481,0.0000460864,0.00023640213,0.00016505306,0.9306994,0.007470631,0.047740612,0.0007978131,0.010831282],"study_design_scores_gemma":[0.0000021322742,0.000030637602,0.00030959086,0.000007943005,0.000010980064,0.000052892978,0.000034415458,0.9944617,0.0011197261,0.0038096113,0.00015387985,0.000006422695],"about_ca_topic_score_codex":0.0027551607,"about_ca_topic_score_gemma":0.0022175089,"teacher_disagreement_score":0.0027551607,"about_ca_system_score_codex":0.0010368248,"about_ca_system_score_gemma":0.0007339679,"threshold_uncertainty_score":0.01184994},"labels":[],"label_agreement":null},{"id":"W2565396475","doi":"10.1109/jsac.2017.2726378","title":"Highly Efficient 3-D Resource Allocation Techniques in 5G for NOMA-Enabled Massive MIMO and Relaying Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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":"Western University","funders":"","keywords":"Noma; Computer science; MIMO; Scheduling (production processes); Spectral efficiency; Computer network; Maximization; Resource allocation; Distributed computing; Computer engineering; Telecommunications link; Channel (broadcasting); Mathematical optimization; Mathematics","score_opus":0.028445713825531217,"score_gpt":0.28781219625130766,"score_spread":0.2593664824257764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565396475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041167222,0.0020323626,0.9501379,0.00026841724,0.000060328803,0.00003833891,0.00004697386,0.00019765514,0.0060507194],"genre_scores_gemma":[0.8856767,0.0013975081,0.111194134,0.000114651666,0.000054734435,0.000054390846,0.00004696504,0.000012827876,0.0014481565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977285,0.00009231847,0.000009574125,0.000030210635,0.00006165568,0.000033472737],"domain_scores_gemma":[0.99981695,0.00007523141,0.0000351188,0.000029873148,0.00003299782,0.000009828877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955753,0.00055355765,0.0004002828,0.00031180828,0.00035169703,0.00046568338,0.00043648272,0.00037825314,0.0007470748],"category_scores_gemma":[0.0005420067,0.00016807081,0.0004124221,0.00054157706,0.00033196216,0.00048200449,0.00045612975,0.00038245574,0.0002676262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014305014,0.000067419474,0.0010994179,0.00015968154,0.00006390884,0.00038888288,0.00018653965,0.7445327,0.03576335,0.051827576,0.002638895,0.16312861],"study_design_scores_gemma":[0.00001300872,0.000089089255,0.00040857334,0.0000117765885,0.000016529593,0.00018304246,0.000034699515,0.98438823,0.0033013176,0.008773086,0.0027651691,0.000015416243],"about_ca_topic_score_codex":0.0023254415,"about_ca_topic_score_gemma":0.003298816,"teacher_disagreement_score":0.0023254415,"about_ca_system_score_codex":0.00045627938,"about_ca_system_score_gemma":0.00043971947,"threshold_uncertainty_score":0.0046237707},"labels":[],"label_agreement":null},{"id":"W2583733750","doi":"10.1109/jsac.2017.2659259","title":"Online Stochastic Buy-Sell Mechanism for VNF Chains in the NFV Market","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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 Calgary","funders":"","keywords":"Computer science; Provisioning; Bidding; Service provider; Service (business); Resource allocation; Resource (disambiguation); Computer network; Business; Marketing","score_opus":0.05964577568705401,"score_gpt":0.3245554702241397,"score_spread":0.2649096945370857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583733750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12090676,0.0004192176,0.8645281,0.0007417205,0.00016260652,0.00043568877,0.00030914778,0.00090796495,0.011588765],"genre_scores_gemma":[0.93649614,0.00016541925,0.059763838,0.00016615522,0.000053904238,0.00018750552,0.00012631915,0.00009732642,0.0029434816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970175,0.0011850724,0.00011497705,0.00047036447,0.0005797307,0.0006323738],"domain_scores_gemma":[0.99313605,0.0039330004,0.0009024862,0.0008065198,0.00054324593,0.00067863084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047823093,0.0012979457,0.0021944197,0.00071210053,0.0014431896,0.0026663775,0.0039808876,0.002008961,0.0076292744],"category_scores_gemma":[0.010777733,0.00073024584,0.0013305417,0.0010055945,0.001458234,0.0035395492,0.0024574157,0.0020238303,0.00060916936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010353299,0.00063028006,0.001960483,0.00024934084,0.0001261865,0.00057605805,0.00024907492,0.81679714,0.006035391,0.11262072,0.0064775455,0.053242456],"study_design_scores_gemma":[0.000054330038,0.00007272084,0.00012970011,0.000008461261,0.000010441389,0.00008342798,0.00003157161,0.97370195,0.00036569717,0.024797471,0.0007284081,0.000015832082],"about_ca_topic_score_codex":0.0031563188,"about_ca_topic_score_gemma":0.0031323424,"teacher_disagreement_score":0.0076292744,"about_ca_system_score_codex":0.002458344,"about_ca_system_score_gemma":0.0028941804,"threshold_uncertainty_score":0.02552247},"labels":[],"label_agreement":null},{"id":"W2598778432","doi":"10.1109/jsac.2017.2687838","title":"A Flexible Millimeter-Wave Channel Sounder With Absolute Timing","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":190,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Delay spread; Multipath propagation; Wideband; Computer science; Power delay profile; Electronic engineering; Channel sounding; Bandwidth (computing); Channel (broadcasting); Acoustics; Physics; Telecommunications; MIMO; Engineering","score_opus":0.11130568864117395,"score_gpt":0.29902971661182587,"score_spread":0.1877240279706519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598778432","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.115463644,0.0009278193,0.86055046,0.00043712143,0.0005641364,0.0002126779,0.00044985453,0.008005018,0.013389337],"genre_scores_gemma":[0.5994533,0.0003895844,0.38327527,0.0007877658,0.0002468881,0.00021564566,0.00048592142,0.00027294215,0.014872716],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995295,0.00004551813,0.000019582238,0.000082554216,0.00026654062,0.000056410696],"domain_scores_gemma":[0.99939656,0.00015752067,0.00008764939,0.00013717006,0.00014806437,0.000072928255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051826815,0.00036608978,0.00040298337,0.00068629836,0.00027224206,0.00049601233,0.001014672,0.00068886764,0.0023234896],"category_scores_gemma":[0.00094048225,0.0002354407,0.00021767472,0.00039866904,0.0003683046,0.000912425,0.0009715409,0.00060996326,0.00088669406],"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.00064846716,0.00012701486,0.004011191,0.0002660766,0.000041339168,0.0006401945,0.00022904687,0.013247698,0.48253664,0.01696821,0.008616344,0.4726678],"study_design_scores_gemma":[0.000478945,0.0017811698,0.009376192,0.000121254874,0.0001734183,0.0038574853,0.00016274108,0.27944824,0.5268582,0.0047660214,0.17259924,0.00037702709],"about_ca_topic_score_codex":0.00048507834,"about_ca_topic_score_gemma":0.0006717335,"teacher_disagreement_score":0.0023234896,"about_ca_system_score_codex":0.0002908616,"about_ca_system_score_gemma":0.00044347477,"threshold_uncertainty_score":0.0077728033},"labels":[],"label_agreement":null},{"id":"W2610974334","doi":"10.1109/jsac.2013.130501","title":"Guest Editorial Spectrum and Energy Efficient Design of Wireless Communication Networks: Part I","year":2013,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"McGill University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Computer network; Wireless network; Efficient energy use; Mobile telephony; Mobile radio; Electrical engineering","score_opus":0.02284460766003156,"score_gpt":0.2829143488712801,"score_spread":0.26006974121124854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610974334","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006154549,0.003862671,0.00021218651,0.01258564,0.98192275,0.000013512391,0.000031941105,0.000033602188,0.0012761933],"genre_scores_gemma":[0.00051731,0.0040128534,0.000102574464,0.0042167273,0.98521,0.000012584014,0.000020650115,0.000026665064,0.0058806567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974637,0.00025139202,0.0002779349,0.00034061872,0.0014340733,0.000232315],"domain_scores_gemma":[0.9879376,0.0028898346,0.00072096643,0.0002309035,0.006500435,0.001720272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00336715,0.0027583372,0.0026958673,0.0026777158,0.0018714115,0.005604017,0.0021292728,0.006297826,0.011498699],"category_scores_gemma":[0.011878346,0.00074211525,0.0015881327,0.0011241077,0.0013636852,0.0027018378,0.0010801321,0.01172644,0.008816908],"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.000073819174,0.000019922083,0.000036558442,0.0002750972,0.00001831654,0.00014756268,0.00000952565,0.000058231824,0.00019149209,0.0005108531,0.9900753,0.008583288],"study_design_scores_gemma":[0.00006559988,0.00007142802,0.0003198655,0.00036135377,0.000058341007,0.00047597956,0.000036104426,0.00032163694,0.00043737987,0.0014299868,0.9964001,0.000022168493],"about_ca_topic_score_codex":0.0004400501,"about_ca_topic_score_gemma":0.0009912655,"teacher_disagreement_score":0.011498699,"about_ca_system_score_codex":0.00149753,"about_ca_system_score_gemma":0.0017741995,"threshold_uncertainty_score":0.03846693},"labels":[],"label_agreement":null},{"id":"W2620812122","doi":"10.1109/jsac.2017.2690498","title":"Guest Editorial Deployment Issues and Performance Challenges for 5G, Part I","year":2017,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Telecommunications and Broadcasting 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":"Huawei Technologies (Canada)","funders":"","keywords":"Software deployment; Computer science; Telecommunications; Software engineering","score_opus":0.046441513511734006,"score_gpt":0.3110403381219294,"score_spread":0.26459882461019535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620812122","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007078553,0.010225762,0.00017752188,0.04066106,0.94570065,0.000017622398,0.00004610673,0.000044843233,0.003055584],"genre_scores_gemma":[0.0006479801,0.009024416,0.000098157085,0.016535183,0.9640666,0.000016130783,0.00003243675,0.000030898427,0.009548241],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977552,0.00021379796,0.00027554942,0.00028708187,0.0012791706,0.00018911433],"domain_scores_gemma":[0.9886291,0.003618314,0.0005601835,0.00023135,0.0055734324,0.0013876673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003049032,0.0019372838,0.0016742775,0.0018358268,0.0016998021,0.005603284,0.001765214,0.009375861,0.012762473],"category_scores_gemma":[0.01444342,0.0005068262,0.0011303659,0.000833187,0.001562205,0.0035883102,0.0010956957,0.0147323925,0.01205399],"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.000024836027,0.000011953093,0.000027193817,0.00021527134,0.0000047537005,0.00015708922,0.000012789857,0.00003324283,0.000095532916,0.00054395833,0.98937476,0.009498585],"study_design_scores_gemma":[0.000018978,0.000028103866,0.00015205186,0.0003718832,0.0000130660355,0.00041942604,0.000042396416,0.000074826734,0.00013330177,0.00091828743,0.99781513,0.000012571116],"about_ca_topic_score_codex":0.0006443675,"about_ca_topic_score_gemma":0.0011574241,"teacher_disagreement_score":0.012762473,"about_ca_system_score_codex":0.0017900041,"about_ca_system_score_gemma":0.0018380624,"threshold_uncertainty_score":0.042694747},"labels":[],"label_agreement":null},{"id":"W2626422957","doi":"10.1109/jsac.2017.2725879","title":"Capacity Comparison Between MIMO-NOMA and MIMO-OMA With Multiple Users in a Cluster","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":374,"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; National Science Foundation","keywords":"MIMO; Noma; Computer science; Interference (communication); Single antenna interference cancellation; Channel capacity; Channel (broadcasting); Signal-to-noise ratio (imaging); Multi-user MIMO; Algorithm; Telecommunications; Telecommunications link","score_opus":0.05451695228955756,"score_gpt":0.30101587936252977,"score_spread":0.24649892707297222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626422957","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.69972306,0.0068677897,0.2665648,0.0006642009,0.00040131484,0.00018791102,0.00035900009,0.0008502267,0.024381798],"genre_scores_gemma":[0.99269134,0.00036604548,0.0062764254,0.0000344947,0.000035727473,0.000032607666,0.000049623835,0.000014073448,0.00049976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833316,0.00053730566,0.00006487503,0.00017375356,0.00039817335,0.0004927189],"domain_scores_gemma":[0.99315757,0.0042408146,0.0004379933,0.0005968078,0.0012948688,0.0002719517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021543086,0.0009427849,0.0012738524,0.0014470827,0.0012683589,0.0016418619,0.0013256636,0.00085325824,0.0022705486],"category_scores_gemma":[0.0065224557,0.00028057455,0.00065669627,0.0019483995,0.001241183,0.0013968433,0.0021717823,0.00058988534,0.0003477076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014761216,0.00017299603,0.0036763344,0.00040358768,0.00021998477,0.0004055016,0.00023333526,0.9166415,0.011200211,0.028994922,0.001909491,0.034666054],"study_design_scores_gemma":[0.000029728348,0.0002443901,0.0013731025,0.000021601058,0.00006778738,0.00019357624,0.00023127712,0.98789644,0.004391986,0.0048743146,0.00062553125,0.00005020165],"about_ca_topic_score_codex":0.0061146934,"about_ca_topic_score_gemma":0.004815521,"teacher_disagreement_score":0.0061146934,"about_ca_system_score_codex":0.0017708637,"about_ca_system_score_gemma":0.0017518846,"threshold_uncertainty_score":0.012848616},"labels":[],"label_agreement":null},{"id":"W2736030218","doi":"10.1109/jsac.2017.2710438","title":"Guest Editorial Part 2: Deployment Issues and Performance Challenges for 5G","year":2017,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"Huawei Technologies (Canada)","funders":"University of Auckland; University of Engineering and Technology, Lahore","keywords":"Computer science; Information retrieval; Software deployment; Field (mathematics)","score_opus":0.05872968239838985,"score_gpt":0.32513173254787486,"score_spread":0.26640205014948504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736030218","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010726655,0.0025059774,0.00023592105,0.02713444,0.9662553,0.00001782092,0.00006359353,0.00006400794,0.0036157074],"genre_scores_gemma":[0.0012650278,0.0044657793,0.00017057333,0.011729212,0.9632085,0.000020296642,0.00006152282,0.00007663125,0.019002428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729353,0.00025760903,0.00026667558,0.00037070166,0.0015632282,0.00024824557],"domain_scores_gemma":[0.98866546,0.002575284,0.00051022,0.000290962,0.00640657,0.0015515392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037968557,0.0018985088,0.0013976863,0.0021863896,0.0021236583,0.0055593965,0.0017451795,0.0067648543,0.0176165],"category_scores_gemma":[0.0125326635,0.000493713,0.0012956273,0.00097118836,0.0013538522,0.003406217,0.0010775236,0.011057556,0.012520631],"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.000024504425,0.000011504109,0.000034081422,0.00011727971,0.000005900719,0.00011575307,0.00001229385,0.000037497863,0.000110311405,0.0004866179,0.993148,0.005896132],"study_design_scores_gemma":[0.000020767482,0.000034279947,0.00018606505,0.00023647184,0.000022093887,0.00020837485,0.000054924203,0.0001575777,0.0002637501,0.0011602902,0.99764204,0.000013369408],"about_ca_topic_score_codex":0.00072290323,"about_ca_topic_score_gemma":0.0017077894,"teacher_disagreement_score":0.0176165,"about_ca_system_score_codex":0.0021912844,"about_ca_system_score_gemma":0.002447252,"threshold_uncertainty_score":0.05893308},"labels":[],"label_agreement":null},{"id":"W2736111490","doi":"10.1109/jsac.2017.2725178","title":"Dynamic Cell Association for Non-Orthogonal Multiple-Access V2S Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":72,"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 Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Karush–Kuhn–Tucker conditions; Computer science; Optimization problem; Power control; Transmitter power output; Utility maximization problem; Mathematical optimization; Scheduling (production processes); Base station; Handover; Spectral efficiency; Maximization; Small cell; Computer network; Power (physics); Utility maximization; Algorithm; Transmitter","score_opus":0.026567481564701245,"score_gpt":0.3139553542890991,"score_spread":0.28738787272439786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736111490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010187514,0.00094631856,0.9835931,0.00019918487,0.00010270559,0.000053184067,0.000038137365,0.00012020929,0.004759684],"genre_scores_gemma":[0.8638301,0.0020862902,0.12730245,0.00020949698,0.00019860179,0.00030510165,0.00018879407,0.000052004845,0.005827164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992988,0.00022789101,0.000020905725,0.00010807076,0.00024197526,0.00010244666],"domain_scores_gemma":[0.9995372,0.00021759518,0.00006200562,0.00005400414,0.00010380673,0.000025414418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059586886,0.00069085445,0.0005676018,0.00032761428,0.0007791066,0.000972669,0.0009032703,0.0005918158,0.0020547328],"category_scores_gemma":[0.0018106212,0.00021198599,0.00038717387,0.0008785454,0.00061465404,0.00074560044,0.0010949492,0.0009987525,0.0005399488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094875344,0.00007524558,0.0006782056,0.00014311945,0.000041631152,0.00029023067,0.00012121464,0.7843048,0.007013917,0.08321029,0.004799894,0.11922658],"study_design_scores_gemma":[0.000006706889,0.00003814103,0.00010239017,0.0000053696267,0.000005659774,0.00007333417,0.00001836907,0.987564,0.0005979766,0.009379181,0.0022013276,0.000007407322],"about_ca_topic_score_codex":0.003520699,"about_ca_topic_score_gemma":0.006174403,"teacher_disagreement_score":0.003520699,"about_ca_system_score_codex":0.0006951019,"about_ca_system_score_gemma":0.001382386,"threshold_uncertainty_score":0.0070003867},"labels":[],"label_agreement":null},{"id":"W2736153531","doi":"10.1109/jsac.2017.2774706","title":"A Fixed-Scale Pixelated MIMO Visible Light Communication System","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","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":"McMaster University","funders":"","keywords":"Computer science; MIMO; Transmitter; Visible light communication; Channel (broadcasting); Optical wireless; Communications system; Electronic engineering; Telecommunications; Optics; Physics","score_opus":0.021195601478442048,"score_gpt":0.2710614071040442,"score_spread":0.24986580562560215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736153531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14563553,0.0012285891,0.8166549,0.00044525435,0.0004342291,0.00037633604,0.00048589255,0.0049880464,0.029751232],"genre_scores_gemma":[0.862117,0.00043704474,0.122163735,0.00032566092,0.00012393332,0.00025064335,0.00024273204,0.00004496433,0.014294202],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995327,0.00006856269,0.000018558354,0.00013366119,0.00020758033,0.0000389161],"domain_scores_gemma":[0.99979466,0.000030857587,0.00003696609,0.00003724383,0.00007311779,0.000027199698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017291482,0.0003703151,0.00050207606,0.00016772805,0.0004195531,0.00055353396,0.0010616594,0.00057061936,0.003284213],"category_scores_gemma":[0.00019033998,0.00018498534,0.00022703124,0.0002183861,0.00024902684,0.0004805411,0.00062574615,0.00044723976,0.001208228],"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.0006367471,0.0002911798,0.002543652,0.00069276325,0.00009606071,0.0009705248,0.00026090274,0.057900257,0.71573186,0.015379005,0.009842706,0.19565429],"study_design_scores_gemma":[0.00019418506,0.0030647723,0.0051004407,0.000076089236,0.00013733286,0.00253168,0.00009703565,0.72269547,0.21336775,0.00308883,0.049446303,0.00020022348],"about_ca_topic_score_codex":0.0008524237,"about_ca_topic_score_gemma":0.0007789284,"teacher_disagreement_score":0.003284213,"about_ca_system_score_codex":0.00036550954,"about_ca_system_score_gemma":0.00034365823,"threshold_uncertainty_score":0.010986805},"labels":[],"label_agreement":null},{"id":"W2754790691","doi":"10.1109/jsac.2018.2815298","title":"A Scalable Approach for Service Chain Mapping With Multiple SC Instances in a Wide-Area Network","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"Concordia University","funders":"National Science Foundation","keywords":"Scalability; Virtual network; Network topology; Network virtualization; Integer programming; Bandwidth (computing); Software deployment; Node (physics); Tree traversal","score_opus":0.047400484664609374,"score_gpt":0.26391584884276875,"score_spread":0.21651536417815936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754790691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026690533,0.00020799867,0.9673817,0.00040549153,0.000060845916,0.0002762331,0.00019274985,0.00061979855,0.004164705],"genre_scores_gemma":[0.38279548,0.00023269864,0.61262846,0.00025983198,0.000053450956,0.0004628608,0.0005872105,0.00020163026,0.0027784058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.00026011787,0.000024272986,0.00012522128,0.0001640535,0.00013574636],"domain_scores_gemma":[0.9987225,0.00076209486,0.00013088179,0.000119972006,0.00015926451,0.00010531953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011670452,0.0013443315,0.0008672779,0.0005364694,0.0007771679,0.0011726399,0.00161052,0.0010294194,0.005701781],"category_scores_gemma":[0.0022028845,0.0006829278,0.0011269898,0.00094198936,0.00061354524,0.0015941543,0.0013714449,0.0019692688,0.00043861658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004370081,0.0000944921,0.00034883333,0.00010472936,0.000021164578,0.0000935831,0.0000476263,0.9629867,0.0018656759,0.0058950623,0.0013866067,0.027111929],"study_design_scores_gemma":[0.000009443715,0.000026417469,0.00003328835,0.0000050433814,0.000005345676,0.000017142813,0.000019816132,0.99650687,0.00035034993,0.0024936344,0.00052989245,0.000002797377],"about_ca_topic_score_codex":0.0050631636,"about_ca_topic_score_gemma":0.007592844,"teacher_disagreement_score":0.005701781,"about_ca_system_score_codex":0.001050662,"about_ca_system_score_gemma":0.0026471296,"threshold_uncertainty_score":0.01907438},"labels":[],"label_agreement":null},{"id":"W2762920447","doi":"10.1109/jsac.2017.2760159","title":"<italic>Stemflow:</italic> Software-Defined Inter-Datacenter Overlay as a Service","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"Computer science; Cloud computing; Scalability; Computer network; Server; The Internet; Bandwidth (computing); Overlay network; Distributed computing; Operating system","score_opus":0.03563477499469519,"score_gpt":0.29740463401608525,"score_spread":0.26176985902139005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762920447","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.08166841,0.0012771649,0.63664037,0.0061879014,0.0020199341,0.000768023,0.0009993159,0.019527508,0.2509113],"genre_scores_gemma":[0.70117015,0.0015120443,0.19557628,0.00221962,0.00055000914,0.00038911097,0.0018704003,0.001049343,0.095663056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995858,0.00007867746,0.000019742189,0.00006184329,0.0001982854,0.000055576453],"domain_scores_gemma":[0.9995684,0.00006984289,0.000043635056,0.000116181945,0.00015547397,0.00004649656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687746,0.0003540343,0.00013300807,0.00037427235,0.00042597088,0.0010633265,0.00058101135,0.00051792717,0.014475865],"category_scores_gemma":[0.0009113472,0.000095828065,0.00012162014,0.0004564423,0.0005866077,0.0009197522,0.0006411985,0.00049099635,0.003767799],"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.00052383216,0.00026174728,0.0030563388,0.00015283638,0.000023520395,0.00045984914,0.00023457305,0.011511013,0.05608705,0.10699541,0.17276315,0.6479307],"study_design_scores_gemma":[0.0001251322,0.000439372,0.0025836946,0.000068794325,0.000021023847,0.00041639945,0.00010965115,0.19793311,0.08422268,0.016526341,0.6975079,0.000045870453],"about_ca_topic_score_codex":0.002381358,"about_ca_topic_score_gemma":0.002323377,"teacher_disagreement_score":0.014475865,"about_ca_system_score_codex":0.00079221814,"about_ca_system_score_gemma":0.00071339513,"threshold_uncertainty_score":0.04842657},"labels":[],"label_agreement":null},{"id":"W2769746582","doi":"10.1109/jsac.2017.2774578","title":"Visible-Light Multi-Gb/s Transmission Based on Resonant Cavity LED With Optical Energy Feed","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":15,"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 Waterloo; Universität Wien; European Commission","keywords":"Transmission (telecommunications); Computer science; Baseband; Data transmission; Visible light communication; Modulation (music); Transmitter; Symbol rate; Analog transmission; Electronic engineering; Optics; Optical Carrier transmission rates; Physics; Telecommunications; Bandwidth (computing); Light-emitting diode; Analog signal; Bit error rate","score_opus":0.026897758520648674,"score_gpt":0.27975214279221894,"score_spread":0.25285438427157025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769746582","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.9709669,0.0004257469,0.019559458,0.00013370032,0.000051005718,0.000045869503,0.00022980337,0.0014140173,0.0071734497],"genre_scores_gemma":[0.9770403,0.00020930149,0.019609358,0.000039659415,0.000015276031,0.000030001947,0.000072238356,0.000098792945,0.0028851272],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997826,0.00002623505,0.000007988519,0.000048883983,0.00009193534,0.000042388558],"domain_scores_gemma":[0.9996871,0.00011749324,0.000066299035,0.000047145455,0.00006536329,0.000016738628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022095811,0.00036733592,0.00033731794,0.00023883939,0.00022162209,0.00030142508,0.0009350165,0.00042939078,0.0019943614],"category_scores_gemma":[0.0002880322,0.00016686346,0.00019448482,0.00027649774,0.00031781042,0.0004060419,0.00038619945,0.00032650674,0.0007411456],"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.00010604072,0.000037432084,0.00023077992,0.00007871384,0.000007667717,0.00009691262,0.000060563427,0.00027612498,0.99139637,0.00037253185,0.0002866807,0.007050177],"study_design_scores_gemma":[0.0000185506,0.00019567616,0.0009487093,0.0000073921883,0.000011793806,0.00019934171,0.000020939031,0.0069246576,0.98984164,0.000067714675,0.0017489811,0.0000145634485],"about_ca_topic_score_codex":0.0005544511,"about_ca_topic_score_gemma":0.0010314127,"teacher_disagreement_score":0.0019943614,"about_ca_system_score_codex":0.00045803818,"about_ca_system_score_gemma":0.00016173323,"threshold_uncertainty_score":0.006671846},"labels":[],"label_agreement":null},{"id":"W2783764817","doi":"10.1109/jsac.2017.2780979","title":"Guest Editorial Localisation, Communication and Networking With VLC","year":2018,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Semiconductor Lasers and Optical Devices","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":"National Science Foundation","keywords":"Computer science; Visible light communication; Telecommunications; Computer network; Optoelectronics; Light-emitting diode","score_opus":0.012194366417639598,"score_gpt":0.2514214787247306,"score_spread":0.23922711230709098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783764817","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010910087,0.012969456,0.0003989412,0.031753488,0.9448696,0.00002486437,0.00007088166,0.00010372552,0.009699894],"genre_scores_gemma":[0.0010850361,0.009608606,0.00013929985,0.010733752,0.95277613,0.000022164948,0.00005433788,0.00007929372,0.0255014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694014,0.0003285016,0.00023999516,0.00054956716,0.0016461774,0.00029566372],"domain_scores_gemma":[0.99121726,0.0028682814,0.0004479859,0.00034902256,0.0031307687,0.0019867409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027280736,0.0021452797,0.0015615915,0.0026931688,0.0022429896,0.007886158,0.0023467222,0.007564673,0.03532888],"category_scores_gemma":[0.009984136,0.00063563307,0.0013559472,0.0011895751,0.0016919619,0.004569646,0.0020698977,0.011753316,0.020566624],"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.000024155732,0.000012937206,0.00003314939,0.0001751343,0.000004763405,0.00009875461,0.000020283092,0.00003219915,0.000080523336,0.0011888162,0.9893156,0.009013723],"study_design_scores_gemma":[0.000008255812,0.0000250719,0.00009282564,0.00017912347,0.000008097041,0.00025316724,0.000026846814,0.000076725715,0.000111405636,0.00081130146,0.9983997,0.0000074500163],"about_ca_topic_score_codex":0.00084005325,"about_ca_topic_score_gemma":0.0010362101,"teacher_disagreement_score":0.03532888,"about_ca_system_score_codex":0.002212447,"about_ca_system_score_gemma":0.0018199534,"threshold_uncertainty_score":0.11818695},"labels":[],"label_agreement":null},{"id":"W2792336262","doi":"10.1109/jsac.2018.2815430","title":"Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":51,"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; Backup; Network virtualization; Spare part; Provisioning; Computer network; Heuristic; Survivability; Virtual network; Embedding; Virtualization; Distributed computing; Operating system","score_opus":0.06871606863915283,"score_gpt":0.3032380600002412,"score_spread":0.2345219913610884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792336262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09988402,0.00039695,0.8921668,0.000347444,0.000045355835,0.00006450866,0.00010257793,0.00044293323,0.006549576],"genre_scores_gemma":[0.94153297,0.00018826356,0.056423724,0.00004693505,0.000019537358,0.000057997517,0.00006936445,0.00005912011,0.001602142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00018500331,0.000016906066,0.00008695907,0.000104691084,0.00014893118],"domain_scores_gemma":[0.99944824,0.00029569067,0.00008189574,0.00006219376,0.000056625257,0.000055378034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681575,0.0009912692,0.0006593626,0.00054307975,0.0004040325,0.0010023911,0.0010275136,0.0005540084,0.001859378],"category_scores_gemma":[0.0017799701,0.00034948456,0.0003960344,0.0006403856,0.0008338661,0.0015837792,0.0012958094,0.0006129488,0.00015836477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039355196,0.000018319399,0.00016469842,0.000028184157,0.000007860357,0.000038445367,0.000029064484,0.9770371,0.0014775135,0.007047716,0.00040247943,0.013709354],"study_design_scores_gemma":[0.0000039668193,0.000024679764,0.000053462252,0.000004280744,0.000005240243,0.000024167148,0.000023747973,0.992531,0.00068436214,0.0062467232,0.00039498904,0.0000033790177],"about_ca_topic_score_codex":0.0029861506,"about_ca_topic_score_gemma":0.0032902542,"teacher_disagreement_score":0.0029861506,"about_ca_system_score_codex":0.0009907892,"about_ca_system_score_gemma":0.0010798079,"threshold_uncertainty_score":0.0071887374},"labels":[],"label_agreement":null},{"id":"W2794194229","doi":"10.1109/jsac.2018.2815418","title":"Efficient and Secure Service-Oriented Authentication Supporting Network Slicing for 5G-Enabled IoT","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":292,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Authentication (law); Server; Computer security; Service (business)","score_opus":0.025550983249116067,"score_gpt":0.304479354533462,"score_spread":0.2789283712843459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794194229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06603652,0.00052815117,0.9272159,0.00026576334,0.00015889446,0.00024242196,0.000060563132,0.0014555336,0.0040362854],"genre_scores_gemma":[0.9546708,0.00017585892,0.044297706,0.000061255974,0.000037920647,0.00004801548,0.00006261241,0.000016823817,0.00062911474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904186,0.00018353734,0.0000729078,0.0001273956,0.00027711407,0.00029711577],"domain_scores_gemma":[0.9992311,0.00014889066,0.000110290785,0.00021913326,0.00021171862,0.00007885758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899003,0.0006117527,0.0006185816,0.00054801884,0.0013141269,0.0009802436,0.0008811187,0.0006471296,0.00084445975],"category_scores_gemma":[0.0013081564,0.00017410834,0.00062035315,0.0004238724,0.0010302135,0.0020714751,0.0017249337,0.00086576235,0.0003047591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00165518,0.0003682235,0.0067257816,0.00037383338,0.00018561489,0.0018671874,0.0011572151,0.32423443,0.1677322,0.25248927,0.009217826,0.2339932],"study_design_scores_gemma":[0.000038128223,0.0001413472,0.00050021504,0.000017920258,0.0000528506,0.00023317842,0.000104169434,0.9645831,0.015790602,0.014520721,0.00397421,0.000043576118],"about_ca_topic_score_codex":0.0046824403,"about_ca_topic_score_gemma":0.003951738,"teacher_disagreement_score":0.0046824403,"about_ca_system_score_codex":0.000976977,"about_ca_system_score_gemma":0.0020472421,"threshold_uncertainty_score":0.009310365},"labels":[],"label_agreement":null},{"id":"W2802828216","doi":"10.1109/jsac.2018.2832784","title":"Two-Color Scheme for a Multi-Beam Satellite Return Link: Impact of Interference Coordination","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite Communication Systems","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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Real-time computing; Reuse; Air interface; Interference (communication); Communications satellite; Distributed computing; Computer network; Telecommunications; Satellite; Base station; Mathematical optimization","score_opus":0.08713398167093539,"score_gpt":0.3691420958211742,"score_spread":0.2820081141502388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802828216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11771081,0.00050472637,0.8716423,0.00047403018,0.000099802346,0.00018642796,0.000061574174,0.00047422026,0.008846081],"genre_scores_gemma":[0.80830455,0.00022514505,0.18898605,0.00015104483,0.000028651944,0.000069330206,0.000033951383,0.000036300753,0.0021650698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992749,0.00026143735,0.000017702856,0.00009361578,0.00017679059,0.00017554901],"domain_scores_gemma":[0.9990421,0.00042883927,0.00010697027,0.00019234956,0.00014278293,0.00008695585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333522,0.0006864108,0.00048464505,0.00028174784,0.00055493356,0.0011402745,0.001030194,0.0006355492,0.0025317024],"category_scores_gemma":[0.0017306816,0.00020853106,0.00031424436,0.0004917202,0.0008955469,0.0008607727,0.00092845166,0.0007865368,0.0004456696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065706123,0.00039614373,0.0025478513,0.00018935178,0.00007048862,0.0004272758,0.00023936034,0.7336434,0.05223354,0.06614481,0.0032188175,0.14023186],"study_design_scores_gemma":[0.000035683905,0.00017177053,0.00025281333,0.0000073695583,0.000013017556,0.00012905302,0.000042414216,0.98876137,0.005603362,0.0038753897,0.0010929885,0.000014753848],"about_ca_topic_score_codex":0.0043488396,"about_ca_topic_score_gemma":0.007078694,"teacher_disagreement_score":0.0043488396,"about_ca_system_score_codex":0.00084133097,"about_ca_system_score_gemma":0.0021823144,"threshold_uncertainty_score":0.008647084},"labels":[],"label_agreement":null},{"id":"W2806446964","doi":"10.1109/jsac.2018.2844658","title":"Hierarchical Edge Caching in Device-to-Device Aided Mobile Networks: Modeling, Optimization, and Design","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":143,"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":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Cellular traffic; Computer network; Enhanced Data Rates for GSM Evolution; Cache; Network topology; Mobile device; Distributed computing; Cellular network; Mobile computing; Operating system; Telecommunications","score_opus":0.05401710974622137,"score_gpt":0.30357154807563136,"score_spread":0.24955443832941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806446964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06706128,0.0009950019,0.9248123,0.00039942798,0.000032548403,0.0001169063,0.00018225877,0.00027025642,0.006130061],"genre_scores_gemma":[0.94786906,0.00094269123,0.048473425,0.00007053038,0.00002668355,0.00016852592,0.00008868843,0.000036693662,0.00232369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00016865018,0.000014742617,0.000065322,0.00008955927,0.00009050338],"domain_scores_gemma":[0.99932265,0.00040154267,0.00009882717,0.000041948104,0.000103800776,0.000031211082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953226,0.00071332004,0.0009027094,0.0005033318,0.00049308443,0.0010291032,0.0012146374,0.0011440329,0.0010527831],"category_scores_gemma":[0.0018705844,0.00043593277,0.0005332375,0.0008935601,0.0008125904,0.0009862572,0.00074934185,0.0005656794,0.00018209833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011829144,0.0000094183415,0.00031040335,0.000021851572,0.0000072650323,0.00002669234,0.000011945046,0.989972,0.0005112708,0.0065861368,0.00018821369,0.0023429862],"study_design_scores_gemma":[0.000001334902,0.000006239146,0.00004903838,0.0000014803888,0.0000033214412,0.000005394708,0.0000041398216,0.99854255,0.0000755491,0.0012089792,0.00010038501,0.0000015884707],"about_ca_topic_score_codex":0.010693031,"about_ca_topic_score_gemma":0.010988084,"teacher_disagreement_score":0.010693031,"about_ca_system_score_codex":0.0019733198,"about_ca_system_score_gemma":0.0013673044,"threshold_uncertainty_score":0.021261632},"labels":[],"label_agreement":null},{"id":"W2885423658","doi":"10.1109/jsac.2018.2864423","title":"Airborne Communication Networks: A Survey","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":336,"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; National Science Fund for Distinguished Young Scholars; National Science Foundation","keywords":"Computer science; Quality of service; Telecommunications; Computer network; Wireless network; Wireless","score_opus":0.026396375737121627,"score_gpt":0.27193485462290096,"score_spread":0.24553847888577934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885423658","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.00657552,0.87861985,0.03203952,0.0029917916,0.0032349627,0.00018550953,0.0010290827,0.0004044602,0.07491933],"genre_scores_gemma":[0.024931533,0.93950087,0.012161447,0.0008628022,0.002390129,0.000113738366,0.001742856,0.000065129025,0.018231435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995121,0.000083064355,0.000053072486,0.00008190801,0.00021389336,0.00005603856],"domain_scores_gemma":[0.9992773,0.00027392403,0.000068001435,0.00004426474,0.00028603582,0.000050499206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047332208,0.0007660529,0.0005506969,0.0024923116,0.00072755036,0.0021019832,0.0008450831,0.0010276526,0.009344358],"category_scores_gemma":[0.0010518874,0.00030830572,0.00031948765,0.0050375354,0.00027533475,0.0033771086,0.000790312,0.0009787304,0.0040860535],"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.000045387616,0.00007312162,0.0022070955,0.0036872025,0.000033927357,0.00024329634,0.00017171599,0.0038995764,0.0015882921,0.021027124,0.072740115,0.8942831],"study_design_scores_gemma":[0.0000036991617,0.00006233257,0.001453476,0.00092209614,0.000027566874,0.0010270007,0.00025954153,0.0034754719,0.0004309899,0.00598536,0.986329,0.000023457656],"about_ca_topic_score_codex":0.002665898,"about_ca_topic_score_gemma":0.002454258,"teacher_disagreement_score":0.009344358,"about_ca_system_score_codex":0.0005516628,"about_ca_system_score_gemma":0.001196941,"threshold_uncertainty_score":0.031260014},"labels":[],"label_agreement":null},{"id":"W2885828982","doi":"10.1109/jsac.2019.2904352","title":"Spatial Deep Learning for Wireless Scheduling","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":278,"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":"Computer science; Scheduling (production processes); Maximization; Wireless network; Wireless; Schedule; Artificial neural network; Channel (broadcasting); Distributed computing; Mathematical optimization; Computer network; Artificial intelligence; Telecommunications","score_opus":0.016669491435120077,"score_gpt":0.2678567553149181,"score_spread":0.251187263879798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885828982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028483124,0.0008352594,0.9650186,0.000595794,0.000080539765,0.000022998489,0.000114995295,0.00068559556,0.004163095],"genre_scores_gemma":[0.8768179,0.0006868409,0.11479469,0.00028670288,0.00009187656,0.00009936698,0.00027519302,0.000084252475,0.00686309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981517,0.000055895034,0.000008274859,0.000036281068,0.000043205226,0.00004128526],"domain_scores_gemma":[0.99948406,0.00029016007,0.000055234865,0.000049493236,0.00009485747,0.000026072894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056637614,0.00072151946,0.0005533788,0.00036424058,0.0002623006,0.00058296474,0.00088655803,0.00074353564,0.0022386878],"category_scores_gemma":[0.0018026987,0.00034744616,0.00034598814,0.0006083241,0.0005989079,0.0009431842,0.00078961457,0.0013006075,0.0003433491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003135255,0.00003183031,0.00031193843,0.000027057116,0.000017888371,0.0000149120515,0.000012159399,0.94681674,0.0006790307,0.009677461,0.0012040574,0.04117556],"study_design_scores_gemma":[0.0000010909336,0.0000032323758,0.000019459394,0.0000010897356,9.337125e-7,0.0000013290006,0.0000012309805,0.9970336,0.00012468612,0.002700397,0.00011234789,6.355287e-7],"about_ca_topic_score_codex":0.007525959,"about_ca_topic_score_gemma":0.010542224,"teacher_disagreement_score":0.007525959,"about_ca_system_score_codex":0.001286885,"about_ca_system_score_gemma":0.0011339422,"threshold_uncertainty_score":0.0149642825},"labels":[],"label_agreement":null},{"id":"W2888231574","doi":"10.1109/jsac.2018.2871313","title":"Tennison: A Distributed SDN Framework for Scalable Network Security","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","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":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Lancaster University","keywords":"Computer science; Scalability; Computer network; Distributed computing; Network security; Computer security; Operating system","score_opus":0.033473410240919196,"score_gpt":0.30980618417921574,"score_spread":0.2763327739382965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888231574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056914524,0.00027193915,0.978019,0.00021672032,0.00011265422,0.0002085326,0.00016493721,0.009525459,0.0057892282],"genre_scores_gemma":[0.2627924,0.0008811997,0.72411144,0.00036058773,0.000088227054,0.00076973665,0.0012680038,0.0008835424,0.0088449465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993332,0.00013119158,0.000056853565,0.000108205866,0.0002884799,0.00008195679],"domain_scores_gemma":[0.9995134,0.00013053739,0.00005151401,0.00009796538,0.00010682546,0.000099782264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018416353,0.0006973665,0.00045935338,0.00061601616,0.0005984845,0.0011560593,0.0021887848,0.000635527,0.0029319155],"category_scores_gemma":[0.0016366147,0.00033640812,0.0005566677,0.00034353786,0.00096947205,0.0016402839,0.0021203302,0.0014786511,0.00056157936],"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.00064999354,0.0002531484,0.0029430902,0.00044034334,0.00014156691,0.00070897426,0.00074385013,0.3260398,0.030196903,0.3404661,0.03002474,0.26739168],"study_design_scores_gemma":[0.00014698529,0.00014754412,0.00026032492,0.00006779295,0.00003241451,0.00020920827,0.000042448188,0.87265414,0.008175032,0.04560118,0.07260796,0.00005499436],"about_ca_topic_score_codex":0.0047677183,"about_ca_topic_score_gemma":0.005347698,"teacher_disagreement_score":0.0047677183,"about_ca_system_score_codex":0.0011091294,"about_ca_system_score_gemma":0.0026636703,"threshold_uncertainty_score":0.009808242},"labels":[],"label_agreement":null},{"id":"W2888360891","doi":"10.1109/jsac.2018.2864418","title":"Cooperative UAV Cluster-Assisted Terrestrial Cellular Networks for Ubiquitous Coverage","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":184,"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":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stochastic geometry; Cache; Cluster analysis; Base station; Poisson distribution; Cellular network; Real-time computing; Computer network; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.023563081763297362,"score_gpt":0.2710402188204206,"score_spread":0.24747713705712326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888360891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28589717,0.0013204797,0.7068353,0.00018081853,0.000040878298,0.000034981902,0.000087784945,0.00019633993,0.0054062605],"genre_scores_gemma":[0.99212766,0.00031031095,0.006829479,0.000018704528,0.000010048323,0.000012940812,0.000024507697,0.0000060789484,0.00066013244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000062423765,0.0000044363946,0.000032334654,0.000066030916,0.000052459254],"domain_scores_gemma":[0.9995943,0.000203621,0.000060398066,0.000039990107,0.00008169567,0.000019975834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002916691,0.00028067327,0.00024606154,0.00029826057,0.0002586125,0.00036810874,0.0004902214,0.0003354803,0.00052494375],"category_scores_gemma":[0.0009867187,0.00010954994,0.00026106834,0.0006027656,0.00033238428,0.00047432363,0.00037922148,0.00021025122,0.00009716923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054128683,0.000011648596,0.0012583911,0.000037308262,0.000025997593,0.00013571014,0.00007137352,0.9685329,0.0044464744,0.0124402875,0.00058248156,0.012403362],"study_design_scores_gemma":[0.000001081789,0.000012140291,0.00018744639,0.0000012859066,0.0000036765239,0.000016827193,0.000016611528,0.9981529,0.0003262763,0.0010857151,0.00019409927,0.0000019802173],"about_ca_topic_score_codex":0.005591492,"about_ca_topic_score_gemma":0.0046074614,"teacher_disagreement_score":0.005591492,"about_ca_system_score_codex":0.0007953562,"about_ca_system_score_gemma":0.00031142682,"threshold_uncertainty_score":0.011117876},"labels":[],"label_agreement":null},{"id":"W2892518380","doi":"10.1109/jsac.2018.2872366","title":"Simultaneous Wireless Information and Power Transfer at 5G New Frequencies: Channel Measurement and Network Design","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","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":"Carleton University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Maximum power transfer theorem; Network architecture; Wireless; Information transfer; Throughput; Channel (broadcasting); Computer network; Electronic engineering; Telecommunications; Power (physics); Engineering","score_opus":0.031039122912560464,"score_gpt":0.23126472898167416,"score_spread":0.2002256060691137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892518380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018649472,0.0006926068,0.97455275,0.00026614786,0.000053825243,0.00009951357,0.00007607548,0.00017753143,0.0054320837],"genre_scores_gemma":[0.6964402,0.0019493987,0.2974013,0.00017042577,0.00008355902,0.0004722654,0.00013843419,0.000045459332,0.003298998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993375,0.00021114005,0.000020088619,0.00012615904,0.00025686348,0.000048181355],"domain_scores_gemma":[0.99968994,0.00009172251,0.000059679627,0.000044003067,0.00009880373,0.000015837493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006232618,0.00047539003,0.00035129942,0.0003981565,0.0002775328,0.00069661724,0.00078512746,0.00054030964,0.0007343563],"category_scores_gemma":[0.0007551573,0.000251859,0.00025516792,0.0006174707,0.0005449028,0.00096621923,0.0006284069,0.00047323364,0.00023998758],"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.00029352726,0.00017233368,0.0044033057,0.00049308897,0.000103578386,0.00033626243,0.00020704816,0.5306528,0.13914798,0.11641792,0.002978217,0.2047939],"study_design_scores_gemma":[0.000012404655,0.00012333119,0.0010083027,0.000018175606,0.000023686429,0.00019453448,0.000031597796,0.9650586,0.019472502,0.0073988517,0.006626696,0.00003129461],"about_ca_topic_score_codex":0.0015123419,"about_ca_topic_score_gemma":0.001835362,"teacher_disagreement_score":0.0015123419,"about_ca_system_score_codex":0.0011831941,"about_ca_system_score_gemma":0.0006172819,"threshold_uncertainty_score":0.008584738},"labels":[],"label_agreement":null},{"id":"W2896162194","doi":"10.1109/jsac.2018.2853242","title":"Corrections to “Control Link Load Balancing and Low Delay Route Deployment for Software Defined Networks” [Nov 17 2446-2456]","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Computer science; Software deployment; Software; Link (geometry); Algorithm; Computer network; Operating system","score_opus":0.01895787585442206,"score_gpt":0.2709673429063518,"score_spread":0.2520094670519298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896162194","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006874106,0.004490751,0.02916323,0.09434152,0.7255237,0.0005022127,0.014366337,0.015112167,0.115812734],"genre_scores_gemma":[0.012463409,0.007051712,0.023505082,0.07328049,0.06808335,0.000704173,0.017423343,0.00815457,0.78933394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99430263,0.000989589,0.0005670027,0.0006222577,0.0031187853,0.00039970144],"domain_scores_gemma":[0.9794892,0.002546214,0.00081317377,0.0014690851,0.0151653215,0.00051703333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032268662,0.002067305,0.0012055737,0.003995089,0.003339493,0.0044334894,0.004007148,0.0063085156,0.1407986],"category_scores_gemma":[0.031063823,0.001377602,0.0018945697,0.0033680976,0.0013942443,0.0036146992,0.0021761628,0.008629088,0.10859158],"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.000017613278,0.000006884368,0.000033049597,0.000040320614,0.000003491164,0.00002710558,0.00001910587,0.00014365854,0.000085728876,0.0014549835,0.993644,0.004524036],"study_design_scores_gemma":[0.000024894354,0.000018602348,0.00046890028,0.00012051454,0.000008676558,0.000054133056,0.00003983661,0.0005975386,0.00023865521,0.0016582853,0.99674255,0.000027521475],"about_ca_topic_score_codex":0.08405776,"about_ca_topic_score_gemma":0.089688554,"teacher_disagreement_score":0.1407986,"about_ca_system_score_codex":0.0060271374,"about_ca_system_score_gemma":0.0053432053,"threshold_uncertainty_score":0.47101825},"labels":[],"label_agreement":null},{"id":"W2901543935","doi":"10.1109/jsac.2018.2874144","title":"A Novel Distributed Antenna Access Architecture for 5G Indoor Service Provisioning","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Power Line Communications and Noise","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 Waterloo","funders":"","keywords":"Computer science; Distributed antenna system; Antenna (radio); Provisioning; Computer network; Transmission (telecommunications); Electronic engineering; Telecommunications","score_opus":0.04554090190730028,"score_gpt":0.3216840224252611,"score_spread":0.27614312051796086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901543935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019419912,0.00022689262,0.97469246,0.0001583194,0.00007103456,0.00003897752,0.000051038354,0.0004508683,0.0048904996],"genre_scores_gemma":[0.7970115,0.00026750655,0.19688094,0.00011196482,0.00008867272,0.00008145684,0.00009574567,0.00003655044,0.005425704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996215,0.00012540356,0.000010769071,0.00008032589,0.000088960915,0.00007302276],"domain_scores_gemma":[0.9997534,0.00006336457,0.00003305954,0.000048156333,0.000072578245,0.000029466195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030438916,0.0005189254,0.00029940534,0.00021224041,0.00041517804,0.00072750286,0.0011141374,0.0004997782,0.002727233],"category_scores_gemma":[0.0005321441,0.00020676384,0.00033134213,0.00047231454,0.00036915668,0.0006718209,0.00064257986,0.00072870014,0.0007457386],"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.00035970146,0.00016900222,0.0012387383,0.0001474356,0.00006875066,0.0004047709,0.00013280769,0.6247189,0.062316056,0.08653054,0.009921093,0.21399218],"study_design_scores_gemma":[0.000021983555,0.00013011722,0.00022831142,0.000004916955,0.000017691036,0.00020399627,0.000022117929,0.9839024,0.003279008,0.0060013956,0.006176098,0.000011935769],"about_ca_topic_score_codex":0.0013811095,"about_ca_topic_score_gemma":0.0035743976,"teacher_disagreement_score":0.002727233,"about_ca_system_score_codex":0.0007486466,"about_ca_system_score_gemma":0.00061627367,"threshold_uncertainty_score":0.009123504},"labels":[],"label_agreement":null},{"id":"W2901752053","doi":"10.1109/jsac.2018.2871519","title":"Guest Editorial Airborne Communication Networks","year":2018,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"Carleton University","funders":"","keywords":"Dissemination; Computer science; Field (mathematics); Telecommunications; Telecommunications network; Computer network; Data science","score_opus":0.009194278499705938,"score_gpt":0.2573511782719799,"score_spread":0.24815689977227395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901752053","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004850921,0.005211739,0.00016626381,0.023283195,0.96719915,0.000016930271,0.000063400454,0.000049803042,0.0039610234],"genre_scores_gemma":[0.0007964082,0.007013691,0.00012345702,0.01046468,0.95887846,0.000023021637,0.000052501724,0.000047477108,0.022600358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807644,0.00021527731,0.00021695375,0.00031812527,0.0009740149,0.00019930926],"domain_scores_gemma":[0.9928639,0.0016835012,0.0004541811,0.00022299778,0.0036044223,0.0011711105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749563,0.0022566381,0.0014293077,0.0019859134,0.0017116804,0.004738606,0.0014728023,0.006233855,0.025261598],"category_scores_gemma":[0.009607592,0.00049535197,0.0012140481,0.0007924043,0.0011543587,0.0032608048,0.0010410437,0.010901027,0.01876083],"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.000020977808,0.000008215004,0.000021545275,0.0001329519,0.0000046504047,0.00009624901,0.000009187496,0.000028338583,0.00006845409,0.00057765056,0.9918269,0.0072048423],"study_design_scores_gemma":[0.000013581481,0.000016039734,0.00007745616,0.00015692272,0.000009370226,0.00014617464,0.000019695877,0.000048930156,0.00007306143,0.0005801628,0.99885345,0.0000053138797],"about_ca_topic_score_codex":0.00063719426,"about_ca_topic_score_gemma":0.0014310926,"teacher_disagreement_score":0.025261598,"about_ca_system_score_codex":0.0014790483,"about_ca_system_score_gemma":0.0018120947,"threshold_uncertainty_score":0.08450848},"labels":[],"label_agreement":null},{"id":"W2911405393","doi":"10.1109/jsac.2019.2898786","title":"Interference Mitigation for Ultrareliable Low-Latency Wireless Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Networks and Protocols","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Nokia","keywords":"Single antenna interference cancellation; Wireless; Fading; Bandwidth (computing); Telecommunications link; Scalability; Power control; Antenna diversity; Interference (communication); Wireless network","score_opus":0.023038368523198592,"score_gpt":0.2923211005685652,"score_spread":0.2692827320453666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911405393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057294868,0.0010052476,0.93753064,0.0001739721,0.000064776366,0.000047386024,0.000015833506,0.00037850425,0.003488684],"genre_scores_gemma":[0.8873867,0.00051005505,0.10971716,0.00017412784,0.00007094659,0.00006704684,0.00003057486,0.00004287844,0.002000465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992834,0.00015777074,0.000035395024,0.00008619175,0.0003167479,0.00012053196],"domain_scores_gemma":[0.9980229,0.00090621976,0.00035372484,0.00040082543,0.00024391088,0.00007243341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831581,0.00058232894,0.00057725894,0.00051023846,0.0008577944,0.00074784807,0.0011721607,0.00047582257,0.0011246154],"category_scores_gemma":[0.0018063105,0.0002488972,0.00023309118,0.00042219082,0.0010005716,0.0015277824,0.0018756872,0.0011559427,0.00023789961],"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.0007229991,0.00028214854,0.0015604274,0.0006599255,0.0001511447,0.0007296055,0.0011482375,0.1484126,0.36251563,0.14295992,0.0033524972,0.33750492],"study_design_scores_gemma":[0.000062479645,0.00096603064,0.0007088002,0.000073458206,0.0000922708,0.0010530734,0.0004012507,0.76122594,0.18426968,0.03519515,0.01585714,0.000094715484],"about_ca_topic_score_codex":0.00039229263,"about_ca_topic_score_gemma":0.00077313144,"teacher_disagreement_score":0.0011721607,"about_ca_system_score_codex":0.0005240286,"about_ca_system_score_gemma":0.0006346527,"threshold_uncertainty_score":0.0041418076},"labels":[],"label_agreement":null},{"id":"W2912731102","doi":"10.1109/jsac.2019.2895226","title":"Network Function Virtualization-Aware Orchestrator for Service Function Chaining Placement in the Cloud","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":172,"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; Chaining; Cloud computing; Quality of service; Distributed computing; Orchestration; Virtualization; Integer programming; Greedy algorithm; Server; Computer network; Network Functions Virtualization; Service (business); Software-defined networking; Virtual network; Operating system; Algorithm","score_opus":0.041927887042795126,"score_gpt":0.27814228451103823,"score_spread":0.2362143974682431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912731102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039908066,0.00016673053,0.9537267,0.00017001948,0.000057385107,0.000092607756,0.000041849846,0.00060935866,0.005227316],"genre_scores_gemma":[0.7894825,0.00015410448,0.20850436,0.00006689306,0.000019948451,0.00007718518,0.000094298804,0.00007663829,0.0015241142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994618,0.0001464694,0.000018216553,0.000087132285,0.00012835837,0.00015797297],"domain_scores_gemma":[0.99968314,0.00008698891,0.000046315658,0.000050009774,0.000065784516,0.00006776713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063128676,0.0007152863,0.0005859701,0.00048466033,0.0007866889,0.0010091272,0.0009447797,0.00048970117,0.0021850378],"category_scores_gemma":[0.0010943902,0.00020958373,0.00048433864,0.0005684935,0.00049682875,0.00085683743,0.001103603,0.0006878315,0.00031352646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012870983,0.00009189892,0.0011759865,0.00007879633,0.000026644926,0.00015201373,0.00010749955,0.8822525,0.013696681,0.023080364,0.0021993255,0.077009514],"study_design_scores_gemma":[0.000003946306,0.000024249146,0.00007786234,0.000003416315,0.000003969073,0.000024304523,0.000025864088,0.9958045,0.0013164965,0.0019242082,0.00078742387,0.0000037995726],"about_ca_topic_score_codex":0.004658916,"about_ca_topic_score_gemma":0.0059271995,"teacher_disagreement_score":0.004658916,"about_ca_system_score_codex":0.001293461,"about_ca_system_score_gemma":0.002076379,"threshold_uncertainty_score":0.009384811},"labels":[],"label_agreement":null},{"id":"W2913775178","doi":"10.1109/jsac.2019.2894305","title":"Distributed Resource Allocation Optimization in 5G Virtualized Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":132,"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":"Computer science; Resource allocation; Distributed computing; Cloud computing; Resource management (computing); Virtualization; Virtual network; Heuristic; Optimization problem; Convergence (economics); Slicing; Function (biology); Virtual machine; Software deployment; Computer network; Algorithm","score_opus":0.0177474138264852,"score_gpt":0.2603358758632311,"score_spread":0.2425884620367459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913775178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056643024,0.000701373,0.93777645,0.0005400412,0.0000890207,0.0000620384,0.0000756825,0.0001287463,0.0039836415],"genre_scores_gemma":[0.95785767,0.00031039465,0.03892584,0.00010467316,0.00003724208,0.000086164306,0.000043821718,0.00003297676,0.0026012398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985695,0.0006830917,0.00003738091,0.00022641306,0.00020532755,0.00027821225],"domain_scores_gemma":[0.99906343,0.0005603347,0.000121463076,0.0000489764,0.00012958514,0.00007616115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018155875,0.0009771107,0.0013372838,0.0003868889,0.0006090654,0.0015368382,0.0011684402,0.0010199691,0.0012113376],"category_scores_gemma":[0.0023208715,0.0005124364,0.0005066567,0.0007067884,0.0012370629,0.0012898213,0.0012262196,0.00087367557,0.000113167014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003448844,0.000010651586,0.00008962084,0.000011450972,0.000011896298,0.00002672507,0.000011930644,0.99078804,0.0002669607,0.006471173,0.00019571555,0.0020813039],"study_design_scores_gemma":[0.0000057771526,0.0000074087425,0.000028359147,0.0000011428137,0.0000021845526,0.0000041457024,0.000006260523,0.9969246,0.00005616204,0.0028579803,0.00010407462,0.0000017824053],"about_ca_topic_score_codex":0.009309648,"about_ca_topic_score_gemma":0.0057933023,"teacher_disagreement_score":0.009309648,"about_ca_system_score_codex":0.0025623536,"about_ca_system_score_gemma":0.0017997647,"threshold_uncertainty_score":0.018591285},"labels":[],"label_agreement":null},{"id":"W2921833176","doi":"10.1109/jsac.2019.2906791","title":"Cloud-Edge Coordinated Processing: Low-Latency Multicasting Transmission","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","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":"University of Waterloo","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Latency (audio); Cloud computing; Multicast; Baseband; Transmission (telecommunications); Enhanced Data Rates for GSM Evolution; Data transmission; Distributed computing; Operating system; Bandwidth (computing); Telecommunications","score_opus":0.029403774276318823,"score_gpt":0.27966179202223246,"score_spread":0.2502580177459136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921833176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091221154,0.0008677338,0.8996734,0.00026112475,0.00008522827,0.00011277911,0.00014095278,0.00082520203,0.0068124314],"genre_scores_gemma":[0.9280886,0.0002628883,0.070108175,0.00010039872,0.00003832482,0.000059612048,0.000096877724,0.000031166146,0.0012140607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992945,0.00012923444,0.000024759614,0.00012650057,0.00020452785,0.00022041483],"domain_scores_gemma":[0.9991283,0.00027520984,0.00012744406,0.00016214851,0.00023848157,0.00006850927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071271794,0.0007507763,0.00091087975,0.00042843318,0.0009812411,0.0008772806,0.0016633541,0.00059114327,0.0014677354],"category_scores_gemma":[0.0015515479,0.00018716906,0.0003755843,0.0009635212,0.00047863933,0.001187082,0.0011205444,0.0006204962,0.00022522513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097298634,0.00023698446,0.0019742907,0.00032140594,0.00009987733,0.00062012766,0.00022479046,0.71398056,0.048312,0.041318,0.008984509,0.18295458],"study_design_scores_gemma":[0.00001864695,0.0001242115,0.00019835071,0.000006969358,0.00001606096,0.000087188004,0.00003953595,0.9893378,0.0059098843,0.003249124,0.0010029264,0.000009323435],"about_ca_topic_score_codex":0.005863287,"about_ca_topic_score_gemma":0.0070264824,"teacher_disagreement_score":0.005863287,"about_ca_system_score_codex":0.0012969275,"about_ca_system_score_gemma":0.0014035319,"threshold_uncertainty_score":0.011658311},"labels":[],"label_agreement":null},{"id":"W2946574388","doi":"10.1109/jsac.2019.2916280","title":"Economically Optimal MS Association for Multimedia Content Delivery in Cache-Enabled Heterogeneous Cloud Radio Access Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":101,"is_retracted":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":"Computer science; Cache; Computer network; Cloud computing; Quality of service; Radio access network; Wireless network; Wireless; Base station; Mobile station; Telecommunications; Operating system","score_opus":0.04163894882783781,"score_gpt":0.273207789333327,"score_spread":0.2315688405054892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946574388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21343914,0.0012133551,0.78016716,0.0004909395,0.00006768551,0.00009525373,0.00006865313,0.00015093875,0.0043068645],"genre_scores_gemma":[0.9792864,0.00030603848,0.019468153,0.00003902783,0.000022487759,0.00002344019,0.000023358874,0.000015054291,0.0008160527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993142,0.0002566021,0.00002123539,0.0000955975,0.00014505944,0.00016730477],"domain_scores_gemma":[0.99912554,0.00050560274,0.0001379698,0.0000435319,0.00011602332,0.000071400114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009075475,0.000713711,0.00091271894,0.0005414421,0.00071988004,0.0009934807,0.0011405075,0.0006922807,0.0008135453],"category_scores_gemma":[0.0024970034,0.00032933758,0.00036508605,0.0008909459,0.0005830458,0.0015557418,0.0008607694,0.0005712629,0.00010330121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019527548,0.00011598756,0.0018239237,0.000076011165,0.000039236194,0.00030861425,0.00007691384,0.9222518,0.005563998,0.026744174,0.0014404069,0.041363683],"study_design_scores_gemma":[0.0000041886565,0.000021975895,0.0001412694,0.0000021453611,0.000008566236,0.00003185345,0.000020180296,0.99628437,0.0004195007,0.0028709176,0.00019058795,0.0000043499012],"about_ca_topic_score_codex":0.0055159847,"about_ca_topic_score_gemma":0.006299876,"teacher_disagreement_score":0.0055159847,"about_ca_system_score_codex":0.0020391112,"about_ca_system_score_gemma":0.0012133694,"threshold_uncertainty_score":0.0147948265},"labels":[],"label_agreement":null},{"id":"W2962718958","doi":"10.1109/jsac.2018.2844638","title":"Optimized Base-Station Cache Allocation for Cloud Radio Access Network With Multicast Backhaul","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":59,"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":"Backhaul (telecommunications); Computer science; Computer network; Multicast; Cache; Base station; Radio access network; Distributed computing; Mobile station","score_opus":0.06321244226432866,"score_gpt":0.31924059348996614,"score_spread":0.2560281512256375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962718958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0990979,0.0005329735,0.89783114,0.00013708211,0.000025710338,0.00004320236,0.00006426166,0.00021448109,0.0020532953],"genre_scores_gemma":[0.9284045,0.00024383779,0.07040741,0.000043958433,0.000020852145,0.000060596143,0.000060769875,0.000028497156,0.00072962494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960417,0.00012493465,0.00001548408,0.000055209166,0.000107080785,0.000093144736],"domain_scores_gemma":[0.9992962,0.0003812165,0.000103752405,0.000049461094,0.00013484084,0.00003453883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890331,0.0006661837,0.0006442113,0.0003322132,0.00033230474,0.00060239114,0.00078369863,0.0004629962,0.000654915],"category_scores_gemma":[0.0020972576,0.00023376821,0.00028464574,0.00063532783,0.0003878085,0.0007405186,0.0005089442,0.00039954585,0.0001377736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011521888,0.000046587546,0.000756628,0.000051265168,0.000024098688,0.000062073465,0.00003255764,0.95749664,0.008124614,0.0060678404,0.0007034023,0.026519002],"study_design_scores_gemma":[0.0000033612935,0.000014011949,0.000058198897,0.0000013308539,0.0000037109244,0.000007202876,0.0000054635457,0.9986563,0.0005735324,0.0006071788,0.000067868496,0.0000019338768],"about_ca_topic_score_codex":0.0049664755,"about_ca_topic_score_gemma":0.0076009906,"teacher_disagreement_score":0.0049664755,"about_ca_system_score_codex":0.0010461106,"about_ca_system_score_gemma":0.0010750674,"threshold_uncertainty_score":0.009875119},"labels":[],"label_agreement":null},{"id":"W2963336322","doi":"10.1109/jsac.2017.2725519","title":"A Survey on Non-Orthogonal Multiple Access for 5G Networks: Research Challenges and Future Trends","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":2398,"is_retracted":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":"Noma; Computer science; Context (archaeology); Wireless; Computer network; Low latency (capital markets); Throughput; Telecommunications; Wireless network; Key (lock); Computer security; Telecommunications link","score_opus":0.1967780088224745,"score_gpt":0.4161986754228624,"score_spread":0.21942066660038786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963336322","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.0018830547,0.96896756,0.010598579,0.001997358,0.001317619,0.00003195495,0.00010552483,0.000058765683,0.015039583],"genre_scores_gemma":[0.007341952,0.9832577,0.0046158377,0.00066122826,0.0014383257,0.000024587276,0.00016250383,0.00001218271,0.0024856685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994191,0.00012987306,0.00007489214,0.000094970324,0.00023045977,0.000050764236],"domain_scores_gemma":[0.9983525,0.0009989853,0.000114744944,0.00005761886,0.00041600553,0.00006015976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862732,0.00074184017,0.00088039396,0.002350761,0.00044037617,0.0016361901,0.0008132821,0.0011084214,0.005396632],"category_scores_gemma":[0.0017972626,0.00034419826,0.00042112666,0.005704563,0.00041534702,0.003276016,0.0006605816,0.0011516667,0.0023194419],"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.00006422744,0.00009392983,0.0011099504,0.007612911,0.00004679724,0.0002418882,0.00017394779,0.0019659419,0.0020222885,0.031695805,0.034682658,0.9202897],"study_design_scores_gemma":[0.000008694735,0.00020398226,0.0014786886,0.0030864123,0.00008888273,0.0010711456,0.00032099363,0.003537703,0.0009031373,0.017221801,0.9720205,0.000058163885],"about_ca_topic_score_codex":0.0007342999,"about_ca_topic_score_gemma":0.00084977056,"teacher_disagreement_score":0.005396632,"about_ca_system_score_codex":0.0004972379,"about_ca_system_score_gemma":0.0011177672,"threshold_uncertainty_score":0.018053532},"labels":[],"label_agreement":null},{"id":"W2964218543","doi":"10.1109/jsac.2017.2698958","title":"Hybrid Analog and Digital Beamforming for mmWave OFDM Large-Scale Antenna Arrays","year":2017,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":486,"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":"Beamforming; Computer science; Baseband; MIMO; Electronic engineering; WSDMA; Transmitter; Spectral efficiency; Orthogonal frequency-division multiplexing; Precoding; Broadband; Multiplexing; Radio frequency; Antenna (radio); Telecommunications; Bandwidth (computing); Engineering; Channel (broadcasting)","score_opus":0.03551198410412842,"score_gpt":0.2804411348638237,"score_spread":0.2449291507596953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964218543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029630365,0.000095273186,0.99525744,0.0000384412,0.000011271263,0.000012729989,0.000011379984,0.00009699036,0.0015133449],"genre_scores_gemma":[0.31987256,0.00040352458,0.6752551,0.00014136719,0.000061700346,0.00014425593,0.00010761911,0.000036107,0.0039777197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977154,0.00007469703,0.000010281,0.00003536068,0.00008595387,0.000022227556],"domain_scores_gemma":[0.9997348,0.0001238401,0.000036118596,0.000032249663,0.00005562716,0.000017261045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025852228,0.00071807666,0.00037112655,0.00030296878,0.00031402122,0.00054524676,0.00051488914,0.00052575645,0.0026149696],"category_scores_gemma":[0.00073374977,0.00027357164,0.00033481538,0.0005723136,0.00037831985,0.00067365746,0.0005600797,0.0004628116,0.00090525846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011147271,0.000043403525,0.0004987344,0.000113862705,0.00004270055,0.000077635996,0.00007502332,0.64809376,0.034998138,0.030651966,0.0022266367,0.28306672],"study_design_scores_gemma":[0.000010481788,0.000054510507,0.00008524386,0.000006544552,0.0000060966104,0.000034281224,0.000014026826,0.989433,0.0036246749,0.005029503,0.0016928338,0.000008804289],"about_ca_topic_score_codex":0.00064105366,"about_ca_topic_score_gemma":0.0018365285,"teacher_disagreement_score":0.0026149696,"about_ca_system_score_codex":0.00033301927,"about_ca_system_score_gemma":0.0003322145,"threshold_uncertainty_score":0.008747935},"labels":[],"label_agreement":null},{"id":"W2964273215","doi":"10.1109/jsac.2019.2929454","title":"Optimum Low-Complexity Decoder for Spatial Modulation","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reduction (mathematics); Spatial modulation; Probabilistic logic; Computational complexity theory; Channel (broadcasting); Imperfect; MIMO","score_opus":0.03961771189365694,"score_gpt":0.29759779299175826,"score_spread":0.25798008109810133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964273215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062220558,0.00025973664,0.99173063,0.00007705329,0.000018626386,0.000015150859,0.000027272561,0.00014185047,0.0015075523],"genre_scores_gemma":[0.28861585,0.00043767167,0.70755434,0.00019992543,0.000067310466,0.0000860639,0.00018087373,0.00006049383,0.002797448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876535,0.00040212867,0.000069858695,0.0001530982,0.0005183752,0.000091181406],"domain_scores_gemma":[0.9981451,0.0010978819,0.00017603936,0.00019444237,0.00033793965,0.000048719983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220887,0.0006269143,0.00067315425,0.0005584041,0.00035565556,0.00092539104,0.0007193636,0.0007447614,0.001751627],"category_scores_gemma":[0.004270373,0.000273465,0.0003808954,0.000746237,0.0004954731,0.0010878505,0.00080632133,0.0007530313,0.000729867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048459112,0.00010262414,0.0018850256,0.00030606688,0.00007419219,0.00015518215,0.00021094209,0.44489074,0.034494054,0.1670204,0.003853453,0.3465227],"study_design_scores_gemma":[0.000017110915,0.00006970838,0.00016062043,0.000012977496,0.0000072753855,0.00012432755,0.0000117745685,0.9812298,0.0063755335,0.010146148,0.001834909,0.000009812974],"about_ca_topic_score_codex":0.0010063924,"about_ca_topic_score_gemma":0.0014926164,"teacher_disagreement_score":0.001751627,"about_ca_system_score_codex":0.0007682278,"about_ca_system_score_gemma":0.0018338121,"threshold_uncertainty_score":0.005859792},"labels":[],"label_agreement":null},{"id":"W2967101352","doi":"10.1109/jsac.2019.2933954","title":"Deep Learning-Based Decoding of Constrained Sequence Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decoding methods; Convolutional code; Sequential decoding; Algorithm; List decoding; Convolutional neural network; Throughput; Serial concatenated convolutional codes; Bit error rate; Concatenated error correction code; Block code; Artificial intelligence; Wireless; Telecommunications","score_opus":0.041384693533824936,"score_gpt":0.3216702355624585,"score_spread":0.28028554202863354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967101352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352133,0.00054190244,0.90828574,0.0003074087,0.00011392604,0.00004818259,0.00019195133,0.0012362058,0.0057533886],"genre_scores_gemma":[0.83718467,0.00033581306,0.15674148,0.00025070316,0.00003922469,0.00006651981,0.00037386848,0.000103582664,0.004904228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.00009265037,0.000034815734,0.00008440548,0.00019916026,0.00009145158],"domain_scores_gemma":[0.9986443,0.0006474075,0.00013632128,0.0001636233,0.00036859963,0.00003980728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056497,0.00055422547,0.00047136866,0.0003728491,0.00027237137,0.00057272805,0.0007200313,0.0006599158,0.0014502283],"category_scores_gemma":[0.003203532,0.00021077933,0.0003267646,0.0004778304,0.0006845813,0.0011704982,0.00067170087,0.0009809728,0.00036215739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026198933,0.00006325985,0.0012020678,0.00012771288,0.000041465857,0.00021307792,0.00009202815,0.8126152,0.025633404,0.030179488,0.0024353913,0.1271349],"study_design_scores_gemma":[0.0000050693775,0.000023271792,0.00005865008,0.000006109561,0.0000037640598,0.000025753803,0.0000050273284,0.98842955,0.007940731,0.0030526768,0.00044460365,0.0000047607955],"about_ca_topic_score_codex":0.0075209886,"about_ca_topic_score_gemma":0.009514487,"teacher_disagreement_score":0.0075209886,"about_ca_system_score_codex":0.0009540288,"about_ca_system_score_gemma":0.0017605905,"threshold_uncertainty_score":0.014954388},"labels":[],"label_agreement":null},{"id":"W2967528569","doi":"10.1109/jsac.2019.2934004","title":"Decision Directed Channel Estimation Based on Deep Neural Network $k$ -Step Predictor for MIMO Communications in 5G","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"MIMO; Computer science; Fading; Algorithm; Decoding methods; Channel (broadcasting); Space–time block code; Doppler effect; Artificial neural network; Block code; Real-time computing; Electronic engineering; Telecommunications; Machine learning","score_opus":0.02443246724516801,"score_gpt":0.3002353974369793,"score_spread":0.2758029301918113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967528569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08628805,0.0011608403,0.9067364,0.00061583304,0.00012657161,0.000034700905,0.00012057662,0.0005607593,0.0043562576],"genre_scores_gemma":[0.93895215,0.00035595172,0.057430565,0.00022684758,0.00003477785,0.0000393222,0.0001298937,0.00001962763,0.002810786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998203,0.000043940152,0.0000090507765,0.000035401514,0.000047983285,0.00004329603],"domain_scores_gemma":[0.9996294,0.00021445137,0.000030345816,0.00001940751,0.000090201895,0.000016106585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042330226,0.00053043343,0.00045775357,0.00019969563,0.0002634344,0.00046064783,0.0006647346,0.00064081635,0.0010055562],"category_scores_gemma":[0.0012757697,0.00026711813,0.00023642756,0.0003048704,0.0004336369,0.00064334244,0.00050480076,0.0012522963,0.00017129381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003365,0.000034497567,0.0008972273,0.0000340784,0.000024218472,0.00005512065,0.000027057627,0.9471967,0.0016954893,0.0044465354,0.00073460705,0.044784416],"study_design_scores_gemma":[0.0000013867337,0.0000067962596,0.000035708847,0.0000013617781,0.0000016471938,0.0000026735984,0.0000013087952,0.99911577,0.00032987437,0.0004504982,0.000051501327,0.0000014883343],"about_ca_topic_score_codex":0.011737939,"about_ca_topic_score_gemma":0.016261343,"teacher_disagreement_score":0.011737939,"about_ca_system_score_codex":0.0008345219,"about_ca_system_score_gemma":0.00090863724,"threshold_uncertainty_score":0.023339212},"labels":[],"label_agreement":null},{"id":"W2988567901","doi":"10.1109/jsac.2019.2951989","title":"Decentralized PEV Power Allocation With Power Distribution and Transportation Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Electric Vehicles and Infrastructure","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":"Toronto Metropolitan University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Kernel density estimation; Electric vehicle; Scalability; Mathematical optimization; Grid; Scheduling (production processes); Plug-in; Power (physics); Mathematics","score_opus":0.005887803986968835,"score_gpt":0.21933849906264666,"score_spread":0.21345069507567782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988567901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016401654,0.00011367629,0.9795344,0.0001356348,0.000029909794,0.000037949038,0.000045549747,0.000116196046,0.0035850978],"genre_scores_gemma":[0.9410463,0.00019107948,0.05402068,0.000061929975,0.000057002424,0.00010839786,0.000092128816,0.000053461972,0.004369065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994634,0.00014303015,0.000021806987,0.00014715835,0.00013087573,0.00009386778],"domain_scores_gemma":[0.999466,0.00024393345,0.000076801945,0.000059337024,0.0001228942,0.000031026262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052124064,0.00070530106,0.0010893196,0.00032335232,0.00049809273,0.0010701938,0.0012353784,0.0008194502,0.001918244],"category_scores_gemma":[0.0017625365,0.00045486755,0.000421283,0.0007962624,0.0004731845,0.0013527992,0.00088878465,0.0009066417,0.00028350254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034182536,0.0000265486,0.00022014044,0.000051160394,0.000013593323,0.00006909055,0.00002639604,0.96717316,0.0022935574,0.009881911,0.00086428405,0.01934595],"study_design_scores_gemma":[0.0000056645126,0.000015045859,0.00007773616,0.0000014296311,0.0000033173446,0.000018251123,0.0000110577,0.99527776,0.0003585997,0.0038271835,0.00040082404,0.0000031083607],"about_ca_topic_score_codex":0.0034565905,"about_ca_topic_score_gemma":0.0036266411,"teacher_disagreement_score":0.0034565905,"about_ca_system_score_codex":0.0007868741,"about_ca_system_score_gemma":0.0011295673,"threshold_uncertainty_score":0.006872952},"labels":[],"label_agreement":null},{"id":"W3005317604","doi":"10.1109/jsac.2020.2971811","title":"Dynamic Game and Pricing for Data Sponsored 5G Systems With Memory Effect","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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; University of Alberta","funders":"","keywords":"Computer science; Service (business); Revenue; Game theory; Service provider; Data as a service; Sequential game; Population; Non-cooperative game; Uniqueness; Evolutionarily stable strategy; Distributed computing; Computer network; Mathematical economics; Marketing","score_opus":0.03658646069429855,"score_gpt":0.32215155978720644,"score_spread":0.2855650990929079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005317604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2021914,0.0011735993,0.75100696,0.0031819046,0.00024556063,0.00028088977,0.00039100167,0.00012775007,0.041400965],"genre_scores_gemma":[0.9770355,0.00045415634,0.012164134,0.00018792141,0.0000496007,0.0001280103,0.0000622398,0.000018076715,0.009900284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.0004155847,0.000032409953,0.00016882038,0.00017746906,0.00023637609],"domain_scores_gemma":[0.99857485,0.00088388234,0.00017464849,0.000049301863,0.00016538856,0.00015198808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013260639,0.0009613206,0.0012074881,0.0005240284,0.0009713555,0.0020923414,0.0016194723,0.0021899357,0.0061002155],"category_scores_gemma":[0.0044490937,0.00042633017,0.0009736736,0.00055138126,0.0015013688,0.00238775,0.0015116084,0.0020135008,0.0003316531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016975103,0.000103003586,0.0016032543,0.00011434441,0.000068147994,0.0010142718,0.00027069138,0.70740366,0.0021709292,0.27482477,0.0033185042,0.008938646],"study_design_scores_gemma":[0.000021310285,0.000030763404,0.00022078978,0.0000067498295,0.0000145674985,0.00007163505,0.00006905671,0.9737891,0.00011309472,0.024922037,0.000725953,0.000014952917],"about_ca_topic_score_codex":0.008864255,"about_ca_topic_score_gemma":0.0054789027,"teacher_disagreement_score":0.008864255,"about_ca_system_score_codex":0.0022443144,"about_ca_system_score_gemma":0.0016255644,"threshold_uncertainty_score":0.0204072},"labels":[],"label_agreement":null},{"id":"W3005526145","doi":"10.1109/jsac.2020.3019722","title":"Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO","year":2020,"lang":"en","type":"preprint","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sparse and Compressive Sensing 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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compressed sensing; Context (archaeology); Algorithm; MIMO; Constellation; Cluster analysis; Channel (broadcasting); Theoretical computer science; Computer engineering; Computer network; Artificial intelligence","score_opus":0.0619434209928295,"score_gpt":0.3106691160377372,"score_spread":0.2487256950449077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005526145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00951501,0.00027651398,0.9862553,0.0004415572,0.0000717394,0.0000228279,0.000033158347,0.00016284296,0.003221022],"genre_scores_gemma":[0.66399413,0.00095649564,0.32763204,0.0006827814,0.00030549843,0.00015478658,0.00014257676,0.000088074456,0.0060435613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932647,0.00028745277,0.000021080403,0.00009883698,0.00020618792,0.000059982307],"domain_scores_gemma":[0.99857426,0.0007089268,0.00011640738,0.00041564897,0.00011533121,0.00006935812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090798986,0.00055948156,0.00071769045,0.00024255663,0.00032756088,0.00093370874,0.0011274628,0.0007433263,0.0013569562],"category_scores_gemma":[0.0026059067,0.00028095843,0.00042233232,0.00045061015,0.0014225724,0.0015400118,0.0015411502,0.0014648325,0.0005341671],"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.00026730954,0.00009479192,0.0006833189,0.00030489493,0.000108949906,0.00043920448,0.00046086055,0.3541959,0.032451864,0.47383022,0.003972558,0.13318999],"study_design_scores_gemma":[0.00002391335,0.00014973637,0.00014529703,0.000031018062,0.000015285683,0.00021652477,0.000053515545,0.9039458,0.0070049567,0.08346831,0.0049169273,0.000028687182],"about_ca_topic_score_codex":0.00034780754,"about_ca_topic_score_gemma":0.0004688882,"teacher_disagreement_score":0.0013569562,"about_ca_system_score_codex":0.00030442167,"about_ca_system_score_gemma":0.0005722872,"threshold_uncertainty_score":0.004801929},"labels":[],"label_agreement":null},{"id":"W3015609468","doi":"10.1109/jsac.2020.2986851","title":"SFC-Based Service Provisioning for Reconfigurable Space-Air-Ground Integrated Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","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":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Provisioning; Chaining; Virtual network; Computer network; Greedy algorithm; Scheduling (production processes); Mathematical optimization","score_opus":0.051549146429581916,"score_gpt":0.2808584540433913,"score_spread":0.2293093076138094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015609468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06808787,0.0004835772,0.9240754,0.00030862875,0.00007380013,0.0001314491,0.00016607328,0.0008209648,0.005852222],"genre_scores_gemma":[0.91117454,0.00022144082,0.08744814,0.000060148494,0.000023308927,0.00008270757,0.00018249096,0.000042843192,0.00076433405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994209,0.0001304097,0.00002544235,0.00010901793,0.00013442276,0.00017978647],"domain_scores_gemma":[0.99952257,0.00016223261,0.00007770366,0.00007252724,0.000085970256,0.000078943194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039272,0.00074139884,0.000506071,0.00052855996,0.0009157896,0.0008847092,0.0010561781,0.00057693495,0.0017958038],"category_scores_gemma":[0.0010736197,0.00023145127,0.00037716964,0.0009684275,0.0005927122,0.0008635646,0.00085877907,0.0007301251,0.00019831199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081930964,0.000050229813,0.0007584501,0.00006177335,0.000014721655,0.00017835414,0.000077926736,0.9144692,0.005894618,0.017662274,0.0023334154,0.058417168],"study_design_scores_gemma":[0.0000031291784,0.000016571044,0.000078861674,0.0000028134596,0.0000028970214,0.000027053822,0.00001647255,0.9956701,0.0006943244,0.0026918247,0.00079182687,0.000004178408],"about_ca_topic_score_codex":0.009855908,"about_ca_topic_score_gemma":0.011014932,"teacher_disagreement_score":0.009855908,"about_ca_system_score_codex":0.0017164497,"about_ca_system_score_gemma":0.0016258808,"threshold_uncertainty_score":0.019597054},"labels":[],"label_agreement":null},{"id":"W3015755308","doi":"10.1109/jsac.2020.2986591","title":"A Virtual Network Customization Framework for Multicast Services in NFV-Enabled Core Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Computer network; Virtual network; Distributed computing; Multicast; Multipath routing; Routing (electronic design automation); Static routing; Routing protocol","score_opus":0.04369836561036022,"score_gpt":0.29722283132057825,"score_spread":0.253524465710218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015755308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010303013,0.0001269459,0.9834538,0.00015537342,0.00003668315,0.00006925375,0.00003546174,0.0008031159,0.0050164196],"genre_scores_gemma":[0.49985912,0.00033525634,0.4950902,0.00012899128,0.000045425695,0.00021883912,0.0001904367,0.00017413343,0.0039576404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.00011791092,0.000015404896,0.00004825579,0.0001328358,0.0000758257],"domain_scores_gemma":[0.99981815,0.00005128444,0.000022647542,0.000036069698,0.000042432814,0.000029470688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378676,0.00042035116,0.00029921898,0.00038499077,0.0006321498,0.0009860994,0.0013196643,0.00054981105,0.0016252153],"category_scores_gemma":[0.0009878573,0.00018489332,0.00044013734,0.00029939789,0.0005069357,0.001081702,0.00125781,0.0007831741,0.00022210716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007203693,0.00010830423,0.00062592706,0.00007883991,0.000029530165,0.0003400835,0.00021975618,0.65375245,0.013986582,0.21537766,0.005981379,0.10942747],"study_design_scores_gemma":[0.000005111485,0.000024626506,0.00007396175,0.00000930351,0.000005506667,0.000055003347,0.000031742155,0.9788311,0.0011439382,0.012185316,0.0076257465,0.000008640866],"about_ca_topic_score_codex":0.004853805,"about_ca_topic_score_gemma":0.007207843,"teacher_disagreement_score":0.004853805,"about_ca_system_score_codex":0.0011157794,"about_ca_system_score_gemma":0.001296689,"threshold_uncertainty_score":0.0096511245},"labels":[],"label_agreement":null},{"id":"W3015810695","doi":"10.1109/jsac.2020.2986612","title":"Robust Online Composition, Routing and NF Placement for NFV-Enabled Services","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Provisioning; Distributed computing; Virtual network; Server; Network Functions Virtualization; Cloud computing","score_opus":0.05958170375065332,"score_gpt":0.28390660027056275,"score_spread":0.22432489651990944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015810695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033753876,0.00018090465,0.9616053,0.00033541158,0.000053198248,0.000090139605,0.00005558151,0.00041218122,0.0035134275],"genre_scores_gemma":[0.72974944,0.00018760333,0.26651204,0.00011652934,0.000049286555,0.00011196005,0.00013276479,0.00016040856,0.0029799195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.00033043415,0.000033142056,0.00019922286,0.0002333865,0.00027203205],"domain_scores_gemma":[0.9981559,0.0010427613,0.00027045724,0.00020000855,0.0001710754,0.0001597554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016005763,0.0010252583,0.0011976789,0.00043768602,0.0008997135,0.0016150845,0.0013986509,0.0012502887,0.0031117068],"category_scores_gemma":[0.005135224,0.0006350073,0.00059973815,0.0006132062,0.0009743153,0.0016038938,0.0015460949,0.0013751056,0.00047817783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012850281,0.0000884339,0.00058612117,0.00006088177,0.000016455342,0.00008303802,0.00004931443,0.9506223,0.0023444656,0.013925789,0.0015955834,0.030499054],"study_design_scores_gemma":[0.000004819149,0.00001301694,0.000039635284,0.0000035152962,0.0000021045294,0.000021374191,0.000012848025,0.99556303,0.00033312134,0.0037495135,0.00025486454,0.0000021817855],"about_ca_topic_score_codex":0.0042122607,"about_ca_topic_score_gemma":0.0047866777,"teacher_disagreement_score":0.0042122607,"about_ca_system_score_codex":0.002084975,"about_ca_system_score_gemma":0.00242388,"threshold_uncertainty_score":0.015127599},"labels":[],"label_agreement":null},{"id":"W3025598106","doi":"10.1109/jsac.2020.3007059","title":"Joint Design of Reconfigurable Intelligent Surfaces and Transmit Beamforming Under Proper and Improper Gaussian Signaling","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":96,"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; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Beamforming; Computer science; Telecommunications link; Gaussian; Joint (building); Optimization problem; Computational complexity theory; Smart antenna; Mathematical optimization; Computer engineering; Antenna (radio); Antenna array; Algorithm; Telecommunications; Mathematics; Directional antenna","score_opus":0.07657024894509025,"score_gpt":0.26283991397304834,"score_spread":0.1862696650279581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025598106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04057119,0.00013680273,0.9522142,0.00013694761,0.000023795385,0.000036210764,0.00002282948,0.00016542083,0.006692619],"genre_scores_gemma":[0.898462,0.00020074302,0.09908281,0.000060803923,0.00001737812,0.00008598091,0.000026427202,0.00002478896,0.0020391836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944514,0.00017401198,0.000017016986,0.00009569185,0.00016524438,0.00010291597],"domain_scores_gemma":[0.9995845,0.00015661491,0.00010721765,0.000039218234,0.000082037455,0.000030450816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050697796,0.00088565255,0.000549939,0.0002378538,0.00019647185,0.0008546799,0.0007063501,0.0006935367,0.00080148265],"category_scores_gemma":[0.0010911548,0.00028170567,0.00038763002,0.0003242723,0.0008319162,0.00061196,0.0007112473,0.00052587746,0.00026247493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084896834,0.000028204171,0.00051414635,0.000060523347,0.000024247938,0.00012865812,0.0000632074,0.9326834,0.018596936,0.016253158,0.00042786097,0.031134615],"study_design_scores_gemma":[0.0000075098915,0.000076531665,0.000072814575,0.0000034510576,0.0000073296865,0.000031895783,0.000019395076,0.9942016,0.0032442748,0.0018921738,0.00043662355,0.000006362254],"about_ca_topic_score_codex":0.0010056017,"about_ca_topic_score_gemma":0.0010332213,"teacher_disagreement_score":0.0010056017,"about_ca_system_score_codex":0.00054057833,"about_ca_system_score_gemma":0.0006930184,"threshold_uncertainty_score":0.003922224},"labels":[],"label_agreement":null},{"id":"W3034408430","doi":"10.1109/jsac.2020.3000810","title":"On the Spectral and Energy Efficiencies of Full-Duplex Cell-Free Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":126,"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":"Computer science; MIMO; Power control; Spectral efficiency; Mathematical optimization; Computational complexity theory; Transmitter power output; Scheduling (production processes); Scalability; Algorithm; Beamforming; Power (physics); Computer network; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.023852556738514552,"score_gpt":0.22625630981263226,"score_spread":0.2024037530741177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034408430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041885402,0.0017618166,0.9319957,0.00031942516,0.000091974696,0.0000434391,0.00013172318,0.00019680205,0.023573654],"genre_scores_gemma":[0.9062611,0.003088586,0.08606431,0.00020708938,0.0001182093,0.0000917122,0.0001411516,0.00007626447,0.003951626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.0002107658,0.000016111708,0.00008002445,0.00024563263,0.00008266965],"domain_scores_gemma":[0.9983234,0.0011950352,0.00010430477,0.00013268612,0.00020627426,0.00003833862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011017906,0.0008863625,0.0006270912,0.0004898506,0.00029011743,0.0011499949,0.0006143045,0.0005083685,0.002735615],"category_scores_gemma":[0.0039156177,0.00034831572,0.0004740463,0.0008598161,0.0008711079,0.001188562,0.0011629974,0.00096751854,0.0006774127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011748446,0.000055155833,0.00044776738,0.00018948746,0.000030731768,0.000100492456,0.000078286525,0.8842605,0.010044399,0.062268257,0.0018819915,0.04052553],"study_design_scores_gemma":[0.000005176367,0.00004366117,0.00018625594,0.000022822414,0.00000773501,0.00004193227,0.000016219099,0.98723304,0.0023750963,0.009241598,0.00081586686,0.000010612407],"about_ca_topic_score_codex":0.0010598636,"about_ca_topic_score_gemma":0.0012155557,"teacher_disagreement_score":0.002735615,"about_ca_system_score_codex":0.0007084028,"about_ca_system_score_gemma":0.00067835144,"threshold_uncertainty_score":0.009151518},"labels":[],"label_agreement":null},{"id":"W3034450003","doi":"10.1109/jsac.2020.3000884","title":"Uplink-Aided High Mobility Downlink Channel Estimation Over Massive MIMO-OTFS System","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":180,"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":"Telecommunications link; Computer science; MIMO; Orthogonal frequency-division multiplexing; Channel (broadcasting); Electronic engineering; MIMO-OFDM; Algorithm; Real-time computing; Computer network; Engineering","score_opus":0.02949425735384182,"score_gpt":0.26951114628495143,"score_spread":0.24001688893110962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034450003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051791597,0.0002625127,0.94466656,0.00020329274,0.00006736961,0.000026772615,0.00013542462,0.0004883325,0.0023580922],"genre_scores_gemma":[0.91975266,0.00024652662,0.077416316,0.00013371502,0.00006301323,0.000048688256,0.00023578422,0.000018698134,0.00208448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.000101484264,0.000018723533,0.0000940315,0.00016304446,0.00009994215],"domain_scores_gemma":[0.99954236,0.00014684263,0.00006477218,0.000067346766,0.00014185347,0.000036900798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041126175,0.00074452226,0.0006820022,0.0002845478,0.0004915853,0.00054997305,0.00060791255,0.0004913384,0.00079842896],"category_scores_gemma":[0.0013583325,0.0002613829,0.00040196895,0.00040129488,0.00042060608,0.0008878629,0.0008530432,0.00064549607,0.00033464242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035866958,0.00006768159,0.004052953,0.00012769332,0.00007065931,0.0004269946,0.00023214366,0.8014848,0.028420428,0.01202035,0.0022790774,0.15045857],"study_design_scores_gemma":[0.000012960986,0.000038932812,0.000414782,0.0000075277876,0.000010907179,0.00009213819,0.000030809344,0.9941142,0.0028142964,0.0019591553,0.0004888601,0.00001545424],"about_ca_topic_score_codex":0.0065874313,"about_ca_topic_score_gemma":0.006366562,"teacher_disagreement_score":0.0065874313,"about_ca_system_score_codex":0.00041809143,"about_ca_system_score_gemma":0.0009067095,"threshold_uncertainty_score":0.01309818},"labels":[],"label_agreement":null},{"id":"W3038385657","doi":"10.1109/jsac.2020.3005490","title":"3D Channel Tracking for UAV-Satellite Communications in Space-Air-Ground Integrated Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","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 Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Channel (broadcasting); Azimuth; Real-time computing; Trajectory; Probabilistic logic; Satellite; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.051211442101858205,"score_gpt":0.2812260356862205,"score_spread":0.2300145935843623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038385657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013159776,0.00028947985,0.9849341,0.00014971656,0.000046126483,0.000011752817,0.00005695046,0.0002835437,0.0010684807],"genre_scores_gemma":[0.8341424,0.00093249884,0.16143791,0.0001883544,0.00007403994,0.000081208316,0.0002888689,0.00006030661,0.002794409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.000076297714,0.000009859999,0.00005210123,0.00008817664,0.00004541824],"domain_scores_gemma":[0.9995028,0.00024710834,0.000072213435,0.000065296415,0.000083562394,0.000029052197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035115308,0.0004510698,0.00047478185,0.0003153052,0.00046259764,0.00068127725,0.00066314096,0.0005502231,0.001020614],"category_scores_gemma":[0.001693613,0.0003001753,0.00049692165,0.00063564966,0.00046896597,0.0009824202,0.00083825976,0.00092510635,0.0003653688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007599984,0.000018615683,0.0011155523,0.000043075135,0.0000224053,0.00009541974,0.000077586796,0.9213065,0.0030837758,0.013899462,0.0014922203,0.05876937],"study_design_scores_gemma":[0.000001603288,0.000006967873,0.000057071884,0.0000021303977,0.000002507224,0.000017386828,0.0000046759574,0.99776554,0.00030231045,0.0015946426,0.00024194663,0.0000031906538],"about_ca_topic_score_codex":0.009706748,"about_ca_topic_score_gemma":0.008511886,"teacher_disagreement_score":0.009706748,"about_ca_system_score_codex":0.0006512031,"about_ca_system_score_gemma":0.0012207387,"threshold_uncertainty_score":0.01930046},"labels":[],"label_agreement":null},{"id":"W3039219915","doi":"10.1109/jsac.2020.3007044","title":"Large Intelligent Surface Assisted Wireless Communications With Spatial Modulation and Antenna Selection","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":141,"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; National Natural Science Foundation of China","keywords":"Computer science; Antenna diversity; Algorithm; Bit error rate; Wireless; Euclidean distance; Computational complexity theory; Selection (genetic algorithm); Antenna (radio); Telecommunications; Computer engineering; Artificial intelligence; Decoding methods","score_opus":0.039321215318383174,"score_gpt":0.2779054602869929,"score_spread":0.23858424496860975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039219915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079401925,0.0007072742,0.9136244,0.00021984446,0.000039167167,0.000032492564,0.0000282972,0.0003542661,0.0055922656],"genre_scores_gemma":[0.8234483,0.00033738808,0.17380649,0.00011847423,0.000058514746,0.0000598422,0.00005161978,0.000012038509,0.002107373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996859,0.00010606755,0.000011957547,0.0000406632,0.00012077247,0.000034732813],"domain_scores_gemma":[0.99970585,0.00009808568,0.000072830706,0.00005979047,0.00004974226,0.000013701004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021538127,0.0005338915,0.00046751293,0.00037065698,0.0002906645,0.00045162652,0.00056282495,0.00048637405,0.00071469863],"category_scores_gemma":[0.000539858,0.00011512872,0.00021948201,0.0007983023,0.0005364364,0.0007224087,0.000662892,0.00034312854,0.000317202],"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.0006810883,0.00012415808,0.0036555133,0.0002827899,0.00009805557,0.00043368002,0.00026475612,0.11688392,0.2519811,0.05922384,0.002746903,0.56362426],"study_design_scores_gemma":[0.00004203142,0.0005615119,0.0010154445,0.000017810025,0.000039533057,0.00064422126,0.00006417675,0.9285351,0.049323797,0.012070617,0.0076533235,0.000032480544],"about_ca_topic_score_codex":0.00017505819,"about_ca_topic_score_gemma":0.00036871003,"teacher_disagreement_score":0.00071469863,"about_ca_system_score_codex":0.00024667368,"about_ca_system_score_gemma":0.00021678927,"threshold_uncertainty_score":0.0023908615},"labels":[],"label_agreement":null},{"id":"W3039424145","doi":"10.1109/jsac.2020.3005492","title":"Performance Analysis of 5G Mobile Relay Systems for High-Speed Trains","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China; ZTE Corporation","keywords":"Relay; Fading; Computer science; Relay channel; Computer network; Bit error rate; Base station; Bottleneck; Channel (broadcasting); Wireless; Telecommunications; Embedded system","score_opus":0.02953153919983912,"score_gpt":0.27062967080487427,"score_spread":0.24109813160503515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039424145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47351214,0.009323236,0.47540468,0.0015019752,0.00017445588,0.00017471054,0.00077790767,0.0006594456,0.03847136],"genre_scores_gemma":[0.9939612,0.0012035287,0.003253449,0.0000443226,0.000037554237,0.00002953606,0.000088417706,0.000024269624,0.0013577541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987055,0.000500663,0.00004196652,0.00015047721,0.00033800007,0.00026340826],"domain_scores_gemma":[0.9973827,0.0012791491,0.00039895414,0.00011312737,0.00077039015,0.000055753673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030432,0.0012744963,0.00086327584,0.0007912193,0.00060176826,0.0013581831,0.00077789987,0.00092013564,0.0026782013],"category_scores_gemma":[0.0043148743,0.000299923,0.0007029002,0.0009975762,0.0007970573,0.0011995592,0.00081114325,0.0007212895,0.0005170514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016938137,0.000027106676,0.0018939498,0.00019200616,0.00007164784,0.00035427161,0.00016696841,0.96376413,0.007284473,0.016680146,0.0009496311,0.00844619],"study_design_scores_gemma":[0.0000031693257,0.00009836023,0.0009284276,0.000016050144,0.000027808783,0.00013217475,0.00007435234,0.99620914,0.00096010964,0.001177686,0.0003592668,0.000013375069],"about_ca_topic_score_codex":0.00763225,"about_ca_topic_score_gemma":0.005118421,"teacher_disagreement_score":0.00763225,"about_ca_system_score_codex":0.0020914178,"about_ca_system_score_gemma":0.0009389217,"threshold_uncertainty_score":0.015175641},"labels":[],"label_agreement":null},{"id":"W3040668711","doi":"10.1109/jsac.2020.3005469","title":"Optimal UAV Caching and Trajectory in Aerial-Assisted Vehicular Networks: A Learning-Based Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":212,"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":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Leverage (statistics); Trajectory optimization; Inference; Artificial intelligence; Online algorithm; Particle swarm optimization; Optimization problem; Edge computing; Enhanced Data Rates for GSM Evolution; Cluster analysis; Trajectory; Machine learning; Algorithm","score_opus":0.021777081505385577,"score_gpt":0.23479601936332375,"score_spread":0.21301893785793818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040668711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08709248,0.0006990389,0.90759593,0.000654896,0.000052551863,0.00006841569,0.00011841717,0.00038843162,0.0033298736],"genre_scores_gemma":[0.9567652,0.00021497568,0.040733986,0.000110164365,0.000032621778,0.000058976293,0.00012229651,0.000040211013,0.001921646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997063,0.00007273738,0.0000132747255,0.00007604275,0.000053519394,0.000078135905],"domain_scores_gemma":[0.99854714,0.0008492503,0.00018847875,0.00006651249,0.0002602669,0.000088423505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006814321,0.00091358286,0.0012728688,0.00050105125,0.00041969272,0.0009013802,0.0012755686,0.0012289463,0.0011836507],"category_scores_gemma":[0.0029420014,0.00052709895,0.0004275422,0.000529205,0.0008883495,0.0011391427,0.00081890804,0.0009827876,0.00014683144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022414264,0.000013638934,0.00033353613,0.000014548578,0.0000073756105,0.0000187228,0.000009525171,0.99316794,0.00022760997,0.0014935654,0.00017411895,0.0045171874],"study_design_scores_gemma":[0.0000015205799,0.0000048077177,0.00002222269,0.0000011704767,0.0000012625311,0.000001965258,0.000003092678,0.9993487,0.000074760785,0.0005068929,0.000032625823,9.773909e-7],"about_ca_topic_score_codex":0.01829251,"about_ca_topic_score_gemma":0.01392315,"teacher_disagreement_score":0.01829251,"about_ca_system_score_codex":0.0018598239,"about_ca_system_score_gemma":0.0018291206,"threshold_uncertainty_score":0.036372066},"labels":[],"label_agreement":null},{"id":"W3044071959","doi":"10.1109/jsac.2021.3064637","title":"Invoking Deep Learning for Joint Estimation of Indoor LiFi User Position and Orientation","year":2021,"lang":"en","type":"preprint","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","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":"Concordia University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Concordia University; Royal Society","keywords":"Channel (broadcasting); Computer science; Orientation (vector space); Gaussian; Isotropy; Fidelity; Wireless; Communications system; Telecommunications; Electronic engineering; Optics; Physics; Mathematics; Engineering; Geometry","score_opus":0.031144493628682608,"score_gpt":0.2906152091562038,"score_spread":0.2594707155275212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044071959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02525167,0.00019943772,0.9717012,0.0001490522,0.000039337476,0.000014644994,0.000082826286,0.001075717,0.0014862262],"genre_scores_gemma":[0.87690395,0.0002602959,0.11855358,0.00022342715,0.000060844835,0.00006302707,0.00043049135,0.000083961066,0.0034204894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971396,0.000052132153,0.000013317127,0.000076158,0.00007109411,0.00007321767],"domain_scores_gemma":[0.99950373,0.00020735392,0.00006907122,0.000069200585,0.000116129566,0.000034423432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054837676,0.00085497834,0.00058079266,0.0003588151,0.00023173082,0.00059624127,0.00097360177,0.00084809854,0.0011480636],"category_scores_gemma":[0.0021323632,0.00043056716,0.00045133624,0.00046402146,0.00037456685,0.00089539937,0.0011797813,0.0012909785,0.00049819076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013376623,0.00009370638,0.0035211649,0.0000795888,0.00006627064,0.00015324706,0.00008337399,0.7487923,0.007707672,0.0041695447,0.002109869,0.23308948],"study_design_scores_gemma":[0.000001703961,0.000010539405,0.00019888123,0.0000037213847,0.0000033777771,0.000010582704,0.0000040529226,0.99790096,0.0007539237,0.00093906594,0.0001698299,0.0000032474225],"about_ca_topic_score_codex":0.006941678,"about_ca_topic_score_gemma":0.00700413,"teacher_disagreement_score":0.006941678,"about_ca_system_score_codex":0.00044820728,"about_ca_system_score_gemma":0.00078197016,"threshold_uncertainty_score":0.013802528},"labels":[],"label_agreement":null},{"id":"W3080441795","doi":"10.1109/jsac.2020.3018825","title":"Multiple Access in Cell-Free Networks: Outage Performance, Dynamic Clustering, and Deep Reinforcement Learning-Based Design","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":120,"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; Reinforcement learning; Beamforming; Cluster analysis; Telecommunications link; Distributed computing; Optimization problem; Wireless network; Cellular network; Computer network; Wireless; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.025527179943003457,"score_gpt":0.25726495988134673,"score_spread":0.23173777993834327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080441795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035069034,0.0006015473,0.9598945,0.00053952006,0.000046661564,0.000040669758,0.000039981733,0.00020129987,0.003566928],"genre_scores_gemma":[0.9613202,0.00031469227,0.035422575,0.00017639007,0.000032362303,0.00009243937,0.000050406445,0.000027437049,0.0025635774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.00013816064,0.000015019258,0.000106197964,0.000108251326,0.000083311475],"domain_scores_gemma":[0.99894077,0.00054931984,0.00014131374,0.00005453115,0.00024025259,0.00007368915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011553884,0.00060814776,0.0007682908,0.0002494308,0.00028251956,0.00079078705,0.0014322774,0.00092700816,0.0011902115],"category_scores_gemma":[0.0030591444,0.00032650706,0.000309882,0.00035521504,0.0010513153,0.000887868,0.0009213674,0.0011641369,0.00017157056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000248401,0.000024053932,0.0004761791,0.000024583387,0.000014552221,0.00003289627,0.000025585774,0.98012435,0.000529017,0.0077477517,0.0003710128,0.010605207],"study_design_scores_gemma":[0.000001457978,0.0000051202373,0.000020929343,9.5124295e-7,0.0000010651414,0.0000021343205,0.0000011159,0.9989681,0.000039303086,0.00091671146,0.00004222766,7.874448e-7],"about_ca_topic_score_codex":0.008468054,"about_ca_topic_score_gemma":0.0060663046,"teacher_disagreement_score":0.008468054,"about_ca_system_score_codex":0.0014074417,"about_ca_system_score_gemma":0.0011035695,"threshold_uncertainty_score":0.016837537},"labels":[],"label_agreement":null},{"id":"W3081000514","doi":"10.1109/jsac.2020.3018803","title":"Multi-Operator Spectrum Sharing for Massive IoT Coexisting in 5G/B5G Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":96,"is_retracted":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 Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Stackelberg competition; Computer network; Cellular network; Quality of service; Wireless; Femtocell; Wireless network; Mobile network operator; Distributed computing; Telecommunications; Base station","score_opus":0.06410897092425268,"score_gpt":0.306132445582189,"score_spread":0.24202347465793633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081000514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124753796,0.00041585448,0.8690871,0.00038828832,0.00006514414,0.00007240036,0.000022596758,0.00010291363,0.0050918623],"genre_scores_gemma":[0.9803099,0.000110781286,0.018691875,0.000055258395,0.0000151769555,0.000035626737,0.000011939189,0.000008875058,0.0007604913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989849,0.00037411996,0.00002998878,0.00016674525,0.0001932529,0.00025091585],"domain_scores_gemma":[0.99934834,0.00033538343,0.00009391346,0.00004492283,0.00008315061,0.00009429615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013654805,0.00059432414,0.00072866573,0.00029905385,0.0008900342,0.0010664047,0.0011387488,0.0007857303,0.001271281],"category_scores_gemma":[0.0022713654,0.00028553916,0.00066198566,0.00039995817,0.0009259454,0.0017125492,0.0016351482,0.0009283459,0.000118922384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001949959,0.00015515501,0.0018211906,0.000091794456,0.00007604558,0.0007058812,0.0003017642,0.870913,0.0069245277,0.07771034,0.0013778377,0.039727487],"study_design_scores_gemma":[0.000008235683,0.000031298816,0.00008182499,0.0000027086337,0.0000074402483,0.000044335084,0.00003802683,0.9884071,0.00030613857,0.010794185,0.00027244398,0.000006254357],"about_ca_topic_score_codex":0.0037068673,"about_ca_topic_score_gemma":0.0030457636,"teacher_disagreement_score":0.0037068673,"about_ca_system_score_codex":0.00086272374,"about_ca_system_score_gemma":0.0012602035,"threshold_uncertainty_score":0.007370591},"labels":[],"label_agreement":null},{"id":"W3082907477","doi":"10.1109/jsac.2020.3018826","title":"A New Path Division Multiple Access for the Massive MIMO-OTFS Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":141,"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":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Telecommunications link; MIMO; Beamforming; Scheduling (production processes); Orthogonal frequency-division multiplexing; Orthogonal frequency-division multiple access; Doppler effect; Base station; Channel (broadcasting); Algorithm; Angle of arrival; Channel state information; Real-time computing; Electronic engineering; Telecommunications; Antenna (radio); Wireless; Mathematical optimization; Mathematics","score_opus":0.058835597645267156,"score_gpt":0.3094025234634643,"score_spread":0.2505669258181972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082907477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063629565,0.00077356526,0.98874354,0.00015576433,0.0001957794,0.000032614065,0.00004340742,0.0002203988,0.0034720507],"genre_scores_gemma":[0.612215,0.0021754107,0.3760723,0.0004481198,0.0004278428,0.00026305945,0.00016792462,0.00003200194,0.00819839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996277,0.00009399017,0.000012014104,0.00007951831,0.00014756934,0.000039257684],"domain_scores_gemma":[0.99979955,0.000059841426,0.000029177067,0.000034664823,0.000058380938,0.000018410276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027823914,0.00060818635,0.000288216,0.00027739737,0.0004526223,0.0005622215,0.00064229267,0.000453922,0.001239218],"category_scores_gemma":[0.0006740424,0.0001362204,0.00028718493,0.0005385566,0.00039582548,0.0007634971,0.000654579,0.00075939915,0.00036143686],"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.00024329226,0.000109884975,0.0010093609,0.00035722827,0.00010690419,0.0006518434,0.00024370888,0.25878716,0.078656524,0.2124493,0.008691046,0.43869385],"study_design_scores_gemma":[0.000026435828,0.00017600163,0.00027474615,0.000022760785,0.00002302412,0.00046080793,0.00003767587,0.9538649,0.004904749,0.017871043,0.02230686,0.00003108978],"about_ca_topic_score_codex":0.0011559591,"about_ca_topic_score_gemma":0.0021003745,"teacher_disagreement_score":0.001239218,"about_ca_system_score_codex":0.00044207243,"about_ca_system_score_gemma":0.00054420263,"threshold_uncertainty_score":0.0041455626},"labels":[],"label_agreement":null},{"id":"W3089248281","doi":"10.1109/jsac.2020.3019724","title":"Massive Access for 5G and Beyond","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":657,"is_retracted":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":"Australian Research Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Wireless; Cellular network; Wireless network; Telecommunications; Computer security","score_opus":0.0547641495153385,"score_gpt":0.3177449162704811,"score_spread":0.26298076675514265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089248281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022303186,0.25375584,0.5069599,0.01750555,0.0039233537,0.0002398585,0.0004730194,0.00093397347,0.19390532],"genre_scores_gemma":[0.576656,0.28065524,0.0950741,0.005742719,0.005718263,0.00041685955,0.00060776446,0.00013659216,0.034992438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961793,0.00010127725,0.000016796697,0.000067476634,0.0001492651,0.000047202393],"domain_scores_gemma":[0.99956125,0.00019517522,0.00004627478,0.000059983013,0.0001028506,0.000034562556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496162,0.00056450063,0.00043396998,0.00076011807,0.00053582015,0.0015081032,0.0006801812,0.0008941891,0.005596757],"category_scores_gemma":[0.0010813726,0.00017882511,0.00030573958,0.0011430901,0.00091829465,0.002403396,0.0012390817,0.0015563746,0.0011166262],"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.000047062164,0.000026132737,0.0005394569,0.00081337267,0.00002962478,0.00026496264,0.00022665563,0.005794786,0.00554264,0.6197012,0.02726859,0.33974552],"study_design_scores_gemma":[0.000013731024,0.00018680506,0.00086780306,0.00059864734,0.0000528722,0.0012510495,0.00022262573,0.031404804,0.0024545605,0.33331975,0.6295753,0.000052052048],"about_ca_topic_score_codex":0.00082335586,"about_ca_topic_score_gemma":0.00080905017,"teacher_disagreement_score":0.005596757,"about_ca_system_score_codex":0.00074002804,"about_ca_system_score_gemma":0.000622506,"threshold_uncertainty_score":0.018723011},"labels":[],"label_agreement":null},{"id":"W3096460114","doi":"10.1109/jsac.2020.3003065","title":"Guest Editorial Special Issue on Advances in Artificial Intelligence and Machine Learning for Networking","year":2020,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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 Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Telecommunications; Data science","score_opus":0.04343439100199471,"score_gpt":0.32224561682224345,"score_spread":0.27881122582024875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096460114","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025394645,0.0021852087,0.0001004646,0.015791537,0.97859967,0.00002006477,0.00009197212,0.00006049947,0.0031251395],"genre_scores_gemma":[0.00033451052,0.0032501405,0.00009875833,0.0098031005,0.96646035,0.000026748912,0.00007898165,0.00006660005,0.019880788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966814,0.00035999474,0.00033171417,0.0003956313,0.001938636,0.0002925076],"domain_scores_gemma":[0.9880475,0.0026981612,0.0007058458,0.00029275907,0.005701621,0.0025540781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043218248,0.0032112387,0.003088344,0.0037109074,0.0030133214,0.008083405,0.0023875453,0.008954506,0.048262794],"category_scores_gemma":[0.014095809,0.0009741984,0.0019960392,0.0016010153,0.001508774,0.004448595,0.0016445239,0.012568563,0.040676568],"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.000019927214,0.000007262535,0.000014790018,0.00010534622,0.0000062476042,0.000059733404,0.0000042365587,0.000015919393,0.00004388507,0.0002061169,0.9960978,0.003418658],"study_design_scores_gemma":[0.000046022367,0.00002370459,0.00016710033,0.00025203885,0.00002274176,0.00019223153,0.000023948629,0.000117353455,0.00010312322,0.0009720327,0.9980673,0.000012469849],"about_ca_topic_score_codex":0.001205944,"about_ca_topic_score_gemma":0.0051927343,"teacher_disagreement_score":0.048262794,"about_ca_system_score_codex":0.0023054269,"about_ca_system_score_gemma":0.0030732697,"threshold_uncertainty_score":0.16145515},"labels":[],"label_agreement":null},{"id":"W3105649577","doi":"10.1109/jsac.2020.3036962","title":"Multi-Agent Reinforcement Learning Based Resource Management in MEC- and UAV-Assisted Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":495,"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; Resource allocation; Server; Reinforcement learning; EnodeB; Quality of service; Resource management (computing); Mobile edge computing; Distributed computing; Computer network; Controller (irrigation); User equipment; Base station; Artificial intelligence","score_opus":0.02717803149158695,"score_gpt":0.247961890300712,"score_spread":0.22078385880912504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105649577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11608066,0.0008568117,0.8781572,0.00038302917,0.00009918533,0.000058640526,0.00004298374,0.0002343356,0.004087145],"genre_scores_gemma":[0.9856068,0.00010074162,0.013085364,0.000045380748,0.000012646951,0.000027316164,0.00001719795,0.0000089594905,0.0010956345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967,0.00010843886,0.000012008027,0.000069287446,0.000054801945,0.000085371685],"domain_scores_gemma":[0.9994128,0.0003117527,0.00009752515,0.000029642426,0.00009634566,0.000051916526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067431486,0.0005736932,0.00071076525,0.00020652385,0.00030837837,0.0005244089,0.0009502165,0.0005708525,0.00072572636],"category_scores_gemma":[0.0014308883,0.0002500456,0.00023522887,0.00022025013,0.0006135973,0.000626911,0.00064387,0.0005989079,0.0000808351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023212733,0.000016163765,0.0003218053,0.000014981407,0.000012727319,0.000036725687,0.000012849104,0.99197876,0.00045593278,0.0016934354,0.00014078274,0.005292569],"study_design_scores_gemma":[0.0000021547692,0.000008469643,0.00003533359,8.080253e-7,0.0000013951588,0.0000030519168,0.000003254119,0.9994497,0.0000736331,0.00035819045,0.000063208456,8.8510086e-7],"about_ca_topic_score_codex":0.009280123,"about_ca_topic_score_gemma":0.006418872,"teacher_disagreement_score":0.009280123,"about_ca_system_score_codex":0.0008168135,"about_ca_system_score_gemma":0.00089865574,"threshold_uncertainty_score":0.018452227},"labels":[],"label_agreement":null},{"id":"W3110381504","doi":"10.1109/jsac.2020.3041405","title":"Dynamic RAN Slicing for Service-Oriented Vehicular Networks via Constrained Learning","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":177,"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 Waterloo","funders":"Science and Engineering Research Council","keywords":"Computer science; Artificial intelligence","score_opus":0.023678629380708863,"score_gpt":0.269330116435443,"score_spread":0.24565148705473416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110381504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022768475,0.00029645476,0.9747899,0.0001715351,0.000020923513,0.000050095874,0.000034923265,0.00021472356,0.0016529227],"genre_scores_gemma":[0.8932878,0.00027504962,0.10427284,0.00013528395,0.000033199773,0.00012657707,0.00014400929,0.00007198353,0.0016532799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999311,0.00023658681,0.000027460166,0.00016129926,0.00010945304,0.00015419227],"domain_scores_gemma":[0.9982023,0.0012205986,0.00017634587,0.00008005434,0.00020015238,0.0001204768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012389943,0.0011581287,0.001232037,0.00042880484,0.0005113162,0.0009181193,0.001303816,0.0009450575,0.0016107912],"category_scores_gemma":[0.0031642187,0.0006103701,0.00052562694,0.000520064,0.0011094365,0.00154144,0.0011758663,0.0011395307,0.00016979224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027848813,0.000017834904,0.00018102734,0.000021688018,0.00001184931,0.000023213322,0.000019510497,0.9881855,0.0003761256,0.003195408,0.0001891896,0.0077507584],"study_design_scores_gemma":[0.000002755111,0.000006275494,0.000016473412,0.0000014707242,0.0000016213506,0.0000020468387,0.0000033625295,0.99852544,0.00008821767,0.0012896535,0.000061307735,0.000001378785],"about_ca_topic_score_codex":0.013025141,"about_ca_topic_score_gemma":0.008999984,"teacher_disagreement_score":0.013025141,"about_ca_system_score_codex":0.0015813615,"about_ca_system_score_gemma":0.001685948,"threshold_uncertainty_score":0.025898635},"labels":[],"label_agreement":null},{"id":"W3113024443","doi":"10.1109/jsac.2020.3036946","title":"Attention-Weighted Federated Deep Reinforcement Learning for Device-to-Device Assisted Heterogeneous Collaborative Edge Caching","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":150,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; Chongqing Research Program of Basic Research and Frontier Technology; Shenzhen University","keywords":"Computer science; Reinforcement learning; Markov decision process; Edge device; Cache; Enhanced Data Rates for GSM Evolution; Distributed computing; Base station; Computer network; Node (physics); Cloud computing; Integer programming; Mobile edge computing; Quality of service; Server; Markov process; Artificial intelligence","score_opus":0.05197815145586125,"score_gpt":0.302713714603654,"score_spread":0.2507355631477927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113024443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070166655,0.00046992576,0.92613965,0.0003244028,0.00007042768,0.000044007375,0.000060230686,0.00056099077,0.002163653],"genre_scores_gemma":[0.97394466,0.000095499,0.023857474,0.00015409444,0.000019891586,0.00005499738,0.000060229206,0.00002077753,0.0017923681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996094,0.00009868513,0.00001859695,0.000103131075,0.00006917338,0.00010110972],"domain_scores_gemma":[0.9989145,0.0006037984,0.00011428147,0.00007315325,0.00021902393,0.000075302116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220264,0.00079072674,0.0011218506,0.0002675267,0.000314533,0.0006330681,0.0015981399,0.0011699159,0.00125327],"category_scores_gemma":[0.002704994,0.00034713955,0.00039787934,0.00037321044,0.00078421336,0.00091745594,0.0009412138,0.0013106775,0.00018666612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008628682,0.00009628322,0.00091004465,0.000032230517,0.0000290722,0.00008392047,0.00003557031,0.9671172,0.0011033332,0.0033651944,0.00080396293,0.026336947],"study_design_scores_gemma":[0.0000037509187,0.0000107737615,0.00003128201,0.0000011648474,0.000002635766,0.000003347182,0.0000014980134,0.9991684,0.00009239271,0.0006424344,0.00004104365,0.0000013007931],"about_ca_topic_score_codex":0.010679305,"about_ca_topic_score_gemma":0.009853029,"teacher_disagreement_score":0.010679305,"about_ca_system_score_codex":0.0010680071,"about_ca_system_score_gemma":0.0011199409,"threshold_uncertainty_score":0.021234274},"labels":[],"label_agreement":null},{"id":"W3133322928","doi":"10.1109/jsac.2020.3018841","title":"Guest Editorial Massive Access for 5G and Beyond—Part II","year":2021,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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":"Computer science; Telecommunications; Internet of Things; Computer network; World Wide Web","score_opus":0.023708812766033985,"score_gpt":0.31726214699467886,"score_spread":0.2935533342286449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133322928","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029562407,0.0020818824,0.00010391231,0.010183127,0.9860032,0.0000134256925,0.00003132774,0.00003166663,0.0015218353],"genre_scores_gemma":[0.00029422974,0.0022631306,0.000056242196,0.0069858674,0.9824759,0.000014692376,0.000023268243,0.00002519854,0.007861454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977471,0.00024261452,0.00024700482,0.00036659665,0.0011926041,0.00020394781],"domain_scores_gemma":[0.98948985,0.0027748581,0.00070302596,0.00028187557,0.004629046,0.0021213132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033047476,0.0026719372,0.0025523168,0.002491483,0.0020630292,0.0062357727,0.0018075436,0.007916397,0.01962526],"category_scores_gemma":[0.010432225,0.0007451838,0.0016108871,0.0010423199,0.0013359007,0.003106915,0.0011923016,0.013626282,0.015074899],"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.000038275735,0.000012613923,0.000022904887,0.0001741187,0.00000875495,0.00011697294,0.0000067869883,0.000031303298,0.00013496875,0.00038812123,0.9928067,0.0062584],"study_design_scores_gemma":[0.000040163246,0.000049034257,0.00023741003,0.00026399843,0.000022728449,0.00029491624,0.000026077636,0.00017318707,0.0001960368,0.0009671301,0.9977133,0.000016097192],"about_ca_topic_score_codex":0.0005261149,"about_ca_topic_score_gemma":0.0013483776,"teacher_disagreement_score":0.01962526,"about_ca_system_score_codex":0.0014363753,"about_ca_system_score_gemma":0.0017408801,"threshold_uncertainty_score":0.06565297},"labels":[],"label_agreement":null},{"id":"W3138002746","doi":"10.1109/jsac.2021.3064643","title":"Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"Huawei Technologies (Canada); University of Waterloo; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Control reconfiguration; Distributed computing; Resource allocation; Quality of service; Network topology; Computer network; Integer programming; Bandwidth (computing); Heuristic; Traffic grooming; Resource (disambiguation); Scaling; Algorithm; Wavelength-division multiplexing; Artificial intelligence","score_opus":0.028107478882127997,"score_gpt":0.282971924258267,"score_spread":0.254864445376139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138002746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27886352,0.0008347519,0.7072439,0.0004259291,0.0000813304,0.00012784284,0.00015697653,0.00040606718,0.011859619],"genre_scores_gemma":[0.9357656,0.0002607119,0.06273887,0.000063228596,0.000010450608,0.00005260183,0.000065324835,0.000043303266,0.0009998269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.00006368639,0.0000069724406,0.000040454946,0.000040101782,0.00006469104],"domain_scores_gemma":[0.99971837,0.00013542928,0.000058769896,0.000024413153,0.000033807046,0.000029218136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043384053,0.0005391054,0.0003672862,0.00024345859,0.00030369204,0.0006158116,0.000571755,0.00039515644,0.0009030931],"category_scores_gemma":[0.001126016,0.00029784258,0.0002618311,0.00033423142,0.00050079037,0.00068464456,0.0005794896,0.0004855456,0.000089298235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003268051,0.000015896298,0.00029512096,0.000026997533,0.000004577558,0.000055582146,0.000022193424,0.9839924,0.002742228,0.0036397285,0.00024367328,0.008928981],"study_design_scores_gemma":[0.0000033970027,0.000025160272,0.000087947716,0.0000058507894,0.0000027793515,0.000017607937,0.00002791708,0.9965233,0.0010396811,0.0018918451,0.000371896,0.0000025497905],"about_ca_topic_score_codex":0.0044759293,"about_ca_topic_score_gemma":0.0035961014,"teacher_disagreement_score":0.0044759293,"about_ca_system_score_codex":0.0009113029,"about_ca_system_score_gemma":0.00078334025,"threshold_uncertainty_score":0.008899748},"labels":[],"label_agreement":null},{"id":"W3160036209","doi":"10.1109/jsac.2021.3078502","title":"Learning to Reflect and to Beamform for Intelligent Reflecting Surface With Implicit Channel Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":272,"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":"Computer science; Channel (broadcasting); Base station; Artificial neural network; Wireless; Artificial intelligence; Computer network; Telecommunications","score_opus":0.04803678577290461,"score_gpt":0.3467821487054097,"score_spread":0.2987453629325051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160036209","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.009658537,0.00005163597,0.9893749,0.000050681152,0.00001259832,0.000010344314,0.00001331417,0.00019427329,0.0006337891],"genre_scores_gemma":[0.6180175,0.00019619358,0.37665778,0.00019909246,0.000044424258,0.00010637157,0.00017348122,0.00011875912,0.0044863163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973136,0.000078942525,0.000010761712,0.00006322096,0.00007671436,0.000039032675],"domain_scores_gemma":[0.99948704,0.00025536132,0.00006195796,0.000075142634,0.000100119825,0.000020419526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144165,0.0007732526,0.00053998583,0.00023380655,0.00017184758,0.00044210468,0.000835335,0.000684885,0.0012349149],"category_scores_gemma":[0.0017810583,0.00038791166,0.0004888631,0.00032527948,0.0007373485,0.0009845875,0.00082431175,0.0010193237,0.00039515816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008285435,0.000057245416,0.0006042635,0.000049081016,0.000035050336,0.00004535275,0.00006170939,0.860133,0.011589894,0.0067913528,0.0008618309,0.119688295],"study_design_scores_gemma":[0.0000033774754,0.000019015582,0.00005006829,0.0000016386259,0.0000032277062,0.0000100111,0.0000027477488,0.9973304,0.001071656,0.0013188655,0.00018575681,0.0000032776036],"about_ca_topic_score_codex":0.0019747063,"about_ca_topic_score_gemma":0.0029546744,"teacher_disagreement_score":0.0019747063,"about_ca_system_score_codex":0.00037802168,"about_ca_system_score_gemma":0.00067161635,"threshold_uncertainty_score":0.004131198},"labels":[],"label_agreement":null},{"id":"W3160812247","doi":"10.1109/jsac.2021.3088662","title":"Joint Optimisation of Real-Time Deployment and Resource Allocation for UAV-Aided Disaster Emergency Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":189,"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; Royal Academy of Engineering; Ho Chi Minh City University of Technology and Education; Global Challenges Research Fund","keywords":"Computer science; Software deployment; Resource allocation; Joint (building); Resource management (computing); Resource (disambiguation); Real-time computing; Computer network; Computer security; Telecommunications; Operating system","score_opus":0.03364657306110735,"score_gpt":0.2758373300856606,"score_spread":0.24219075702455323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160812247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046277452,0.00040843987,0.9488615,0.00020707217,0.000042341188,0.0000530114,0.00004607947,0.00018907884,0.0039150887],"genre_scores_gemma":[0.91887796,0.00018933068,0.07834305,0.000051311257,0.000021067277,0.00007736458,0.00004402261,0.000041361964,0.0023545052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996605,0.00014759079,0.000010544433,0.000055022363,0.000054027958,0.000072482755],"domain_scores_gemma":[0.999554,0.00026687502,0.000067141365,0.000029609657,0.000054732496,0.000027696635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067245116,0.00082991534,0.0010108992,0.00031935427,0.0003179562,0.00080253923,0.0007299025,0.0009974522,0.001583103],"category_scores_gemma":[0.0014815588,0.0003315589,0.00042421787,0.0005185105,0.0005475252,0.0008225773,0.00064917153,0.0006100345,0.00021033084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025953657,0.000011841274,0.00008612472,0.000020040405,0.000008461495,0.0000166997,0.00001136243,0.9923774,0.0006936081,0.0012157185,0.00018228326,0.005350465],"study_design_scores_gemma":[0.0000046831037,0.000017529235,0.00006020342,0.0000015735922,0.0000029066516,0.0000073360893,0.00001019277,0.9988998,0.00028038622,0.00056280405,0.00015043026,0.0000021681012],"about_ca_topic_score_codex":0.004331115,"about_ca_topic_score_gemma":0.0040114764,"teacher_disagreement_score":0.004331115,"about_ca_system_score_codex":0.00070097257,"about_ca_system_score_gemma":0.0009802912,"threshold_uncertainty_score":0.008611798},"labels":[],"label_agreement":null},{"id":"W3162651254","doi":"10.1109/jsac.2021.3078497","title":"Machine Learning for Detecting Anomalies and Intrusions in Communication Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Machine learning; Artificial intelligence; Recurrent neural network; Intrusion detection system; Artificial neural network; Default gateway; Network security; Data mining; Computer network","score_opus":0.025634472160248566,"score_gpt":0.27670631337080814,"score_spread":0.2510718412105596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162651254","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.1516882,0.010279036,0.82143414,0.0028040337,0.00040282562,0.0003126281,0.000971001,0.0061944867,0.0059135575],"genre_scores_gemma":[0.7951938,0.002992092,0.19745319,0.00024627597,0.00018872946,0.0002144109,0.0014342803,0.000090750844,0.0021865033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799997,0.0006200738,0.00015704335,0.00024763375,0.00088889606,0.00008627295],"domain_scores_gemma":[0.9962303,0.0024601195,0.0003443718,0.000432663,0.0004629422,0.0000695482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029500073,0.0010519595,0.0007959157,0.0019218789,0.0004514705,0.0011589101,0.0008168314,0.000978728,0.0008422915],"category_scores_gemma":[0.008480217,0.00026077006,0.00050577853,0.0018680824,0.0005255185,0.0016474255,0.00065532496,0.0014546445,0.00047673463],"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.00016741737,0.00031092786,0.015157819,0.0003604622,0.00024981768,0.00010665338,0.00007167351,0.37681848,0.004509475,0.0054424927,0.0076548313,0.58914995],"study_design_scores_gemma":[0.0000083710665,0.00009666797,0.0019739524,0.000023182178,0.000017860984,0.000036557252,0.000016672513,0.9899949,0.0023652508,0.004296313,0.0011594339,0.000010750529],"about_ca_topic_score_codex":0.0049777045,"about_ca_topic_score_gemma":0.0043902895,"teacher_disagreement_score":0.0049777045,"about_ca_system_score_codex":0.00093745574,"about_ca_system_score_gemma":0.0008180049,"threshold_uncertainty_score":0.015601337},"labels":[],"label_agreement":null},{"id":"W3166653712","doi":"10.1109/jsac.2021.3087234","title":"Deep Active Learning Approach to Adaptive Beamforming for mmWave Initial Alignment","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":59,"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":"Computer science; Beamforming; Fading; Adaptive beamformer; Channel state information; Channel (broadcasting); Artificial neural network; Algorithm; Artificial intelligence; Telecommunications; Wireless","score_opus":0.06350940356307683,"score_gpt":0.29813270575814066,"score_spread":0.23462330219506383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166653712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020361713,0.00011999665,0.9969367,0.000075092765,0.000015070449,0.0000063410216,0.00001512447,0.00007763031,0.00071794214],"genre_scores_gemma":[0.5530521,0.0008286288,0.43650052,0.00039117772,0.00014917403,0.00016867528,0.0002003848,0.00009448399,0.008614852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997532,0.000068172034,0.000013592393,0.000054542976,0.00007445996,0.00003606257],"domain_scores_gemma":[0.9995246,0.00027289838,0.000043535296,0.000028913331,0.00010827542,0.000021790589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663942,0.0007367529,0.00057018554,0.0003580782,0.00024238553,0.00056798686,0.0012008991,0.000938256,0.0019396251],"category_scores_gemma":[0.0014061949,0.0004404171,0.00043373837,0.00045304382,0.00059406424,0.001059036,0.0008185702,0.0017490858,0.0003352239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007132834,0.000053022544,0.00046528512,0.000075122436,0.000042822947,0.00004627713,0.000053362728,0.8339925,0.0055728327,0.025749903,0.0014002686,0.1324773],"study_design_scores_gemma":[0.0000018460744,0.0000070224046,0.000020261137,0.0000020775935,0.000001840895,0.000004068293,0.0000019656852,0.9965354,0.0004974756,0.0026344836,0.0002918298,0.000001766442],"about_ca_topic_score_codex":0.0030350552,"about_ca_topic_score_gemma":0.0048299003,"teacher_disagreement_score":0.0030350552,"about_ca_system_score_codex":0.0006538,"about_ca_system_score_gemma":0.00077506003,"threshold_uncertainty_score":0.006488681},"labels":[],"label_agreement":null},{"id":"W3166744561","doi":"10.1109/jsac.2021.3088628","title":"Robust 3D-Trajectory and Time Switching Optimization for Dual-UAV-Enabled Secure Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":106,"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":"Science and Technology Commission of Shanghai Municipality; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Coordinate descent; Optimization problem; Trajectory optimization; Mathematical optimization; Jamming; Trajectory; Convex optimization; Artificial noise; Channel (broadcasting); Real-time computing; Algorithm; Computer network; Regular polygon; Transmitter","score_opus":0.024787773334967983,"score_gpt":0.2479857681695021,"score_spread":0.22319799483453412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166744561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017647412,0.0003874705,0.97775817,0.00020715407,0.000048445476,0.000025000101,0.000066703375,0.00016108547,0.003698562],"genre_scores_gemma":[0.9161563,0.00048299105,0.07903249,0.00011306956,0.000035731082,0.000111952155,0.00020883189,0.000072556206,0.0037861587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.00010575238,0.000012695508,0.00008105502,0.0000902554,0.00007902183],"domain_scores_gemma":[0.999419,0.0002939439,0.00010169635,0.000039909115,0.00009487454,0.0000506518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730673,0.0011237898,0.0010111497,0.00043194272,0.0004085826,0.0010344397,0.00069696986,0.00094782223,0.0019753783],"category_scores_gemma":[0.0014009011,0.00049474515,0.0008017069,0.0005591806,0.00073175435,0.00075968285,0.0012106387,0.0011476771,0.00031130185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043546595,0.000012513511,0.00026002328,0.00002955031,0.00001710466,0.000049647046,0.000025240744,0.9861507,0.0007048123,0.0065045324,0.000386505,0.005815842],"study_design_scores_gemma":[0.000002734413,0.0000096837475,0.000032072494,0.0000016273702,0.000001874988,0.000004968847,0.000004957052,0.99874914,0.00009693916,0.0009708502,0.00012295265,0.000002237611],"about_ca_topic_score_codex":0.0062038726,"about_ca_topic_score_gemma":0.0031390856,"teacher_disagreement_score":0.0062038726,"about_ca_system_score_codex":0.001055912,"about_ca_system_score_gemma":0.0011652341,"threshold_uncertainty_score":0.012335479},"labels":[],"label_agreement":null},{"id":"W3169113824","doi":"10.1109/jsac.2021.3088656","title":"Hovering UAV-Based FSO Communications: Channel Modelling, Performance Analysis, and Parameter Optimization","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Key Laboratory of Opto-Technology and Intelligent Control Ministry of Education; National Key Research and Development Program of China; Basic Research Program of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Channel (broadcasting); Relay; Free-space optical communication; Flexibility (engineering); Probability density function; Scintillation; Communications system; Fading; Atmospheric turbulence; Performance improvement; Electronic engineering; Turbulence; Optical communication; Telecommunications; Power (physics); Physics; Mathematics; Engineering","score_opus":0.03649569803119355,"score_gpt":0.26219512534358036,"score_spread":0.22569942731238682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169113824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21542841,0.0023476863,0.76693666,0.0004416524,0.000044075747,0.00008011743,0.00028401223,0.00045779714,0.013979605],"genre_scores_gemma":[0.9816503,0.000988732,0.015352273,0.000026540001,0.000018793027,0.000047503552,0.00010700192,0.000024521436,0.0017843493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.0000565973,0.0000054281377,0.000024363328,0.000055877405,0.000039450813],"domain_scores_gemma":[0.99969447,0.00014402738,0.000070290465,0.000021466638,0.0000584882,0.000011208153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030258688,0.00089690124,0.0006284389,0.00030921353,0.00042671378,0.0008964532,0.00039229545,0.00073861994,0.0007320606],"category_scores_gemma":[0.0008041709,0.00023125032,0.00035842624,0.0005957156,0.0005540279,0.00063213776,0.0004748733,0.0005437235,0.00024133055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152243165,0.0000108266495,0.00032332842,0.000019728503,0.00000616811,0.000047907746,0.000023057588,0.99231684,0.0016715357,0.0016415361,0.0001760688,0.0037477955],"study_design_scores_gemma":[0.0000011272599,0.000008597987,0.00008720115,0.0000016327061,0.0000023137325,0.000010927669,0.000007698392,0.9991478,0.0003314519,0.00031551864,0.00008307566,0.0000026203604],"about_ca_topic_score_codex":0.014227099,"about_ca_topic_score_gemma":0.009203959,"teacher_disagreement_score":0.014227099,"about_ca_system_score_codex":0.00096702366,"about_ca_system_score_gemma":0.00086678215,"threshold_uncertainty_score":0.028288543},"labels":[],"label_agreement":null},{"id":"W3169817290","doi":"10.1109/jsac.2021.3088626","title":"UAV-LEO Integrated Backbone: A Ubiquitous Data Collection Approach for B5G Internet of Remote Things Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":161,"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":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Data collection; Upload; Cache; Backhaul (telecommunications); Energy consumption; Data transmission; Telecommunications link; Real-time computing; Computer network; Base station","score_opus":0.03988887690602254,"score_gpt":0.27726215395561005,"score_spread":0.2373732770495875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169817290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022129275,0.00050838676,0.9740337,0.00016567794,0.000045910674,0.00006562048,0.000040962237,0.00020447005,0.002806022],"genre_scores_gemma":[0.7524926,0.00070699933,0.2441545,0.00015702865,0.00006248384,0.00014851273,0.0001551088,0.000045175624,0.002077517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963474,0.00010577151,0.000012961863,0.000084512125,0.00009567158,0.000066310415],"domain_scores_gemma":[0.9997714,0.00006912109,0.000039318184,0.00004017826,0.00005311781,0.000026849057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004482607,0.00070867187,0.00059477915,0.00037584075,0.0005759548,0.0006995345,0.0009372883,0.00058843265,0.00077400904],"category_scores_gemma":[0.0008096154,0.0002539987,0.00042004112,0.00076268194,0.0004139703,0.0013328393,0.001142264,0.0006511574,0.00019395167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017932666,0.0001562946,0.0016272677,0.00016730602,0.00006714407,0.00039851622,0.00024742621,0.75644475,0.018472252,0.025541946,0.003832038,0.19286579],"study_design_scores_gemma":[0.0000062896843,0.00006717338,0.00017173245,0.000005417498,0.0000093675635,0.00006368478,0.000041296287,0.9947202,0.0011930228,0.0024530943,0.0012616992,0.0000068797804],"about_ca_topic_score_codex":0.0043107527,"about_ca_topic_score_gemma":0.0063156663,"teacher_disagreement_score":0.0043107527,"about_ca_system_score_codex":0.0005579976,"about_ca_system_score_gemma":0.0008145486,"threshold_uncertainty_score":0.008571327},"labels":[],"label_agreement":null},{"id":"W3170485195","doi":"10.1109/jsac.2021.3087243","title":"An Efficient Specific Emitter Identification Method Based on Complex-Valued Neural Networks and Network Compression","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":282,"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":"Key Laboratory of Universal Wireless Communications of Ministry of Education; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Identification (biology); Baseband; Artificial neural network; Computer engineering; Convergence (economics); Artificial intelligence; Algorithm; Machine learning; Telecommunications; Bandwidth (computing)","score_opus":0.05969386022215609,"score_gpt":0.3339043302936762,"score_spread":0.2742104700715201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170485195","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.008972889,0.00033676645,0.9884992,0.00013101293,0.0000641769,0.000024971583,0.000039621435,0.00048544392,0.0014459393],"genre_scores_gemma":[0.4857577,0.0010215397,0.5020165,0.00034871808,0.00017277942,0.00020413147,0.00060865504,0.00015232549,0.009717587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997265,0.000033702057,0.000020589321,0.000073232266,0.000117548756,0.000028470058],"domain_scores_gemma":[0.9996948,0.00008980129,0.00003715795,0.00003565881,0.00013007675,0.00001259553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003767679,0.00072409975,0.000661437,0.00054305414,0.00028952444,0.0005036218,0.000961016,0.0006958267,0.0014740454],"category_scores_gemma":[0.001209645,0.00028918099,0.00057174766,0.00059725053,0.0002967369,0.0012306453,0.000722288,0.001277399,0.00045015852],"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.000120830584,0.000061943116,0.0012899478,0.00014991488,0.000074892596,0.00012721133,0.0000867966,0.35480538,0.019551994,0.009611046,0.0034854873,0.61063457],"study_design_scores_gemma":[0.0000032786386,0.000012631814,0.00014288154,0.0000051619886,0.0000075554926,0.000043083517,0.000005576987,0.9950362,0.0028674998,0.0011972632,0.00067261176,0.0000061699193],"about_ca_topic_score_codex":0.0042167893,"about_ca_topic_score_gemma":0.003897225,"teacher_disagreement_score":0.0042167893,"about_ca_system_score_codex":0.00046655422,"about_ca_system_score_gemma":0.00061029795,"threshold_uncertainty_score":0.008384466},"labels":[],"label_agreement":null},{"id":"W3170970335","doi":"10.1109/jsac.2021.3088672","title":"Joint Subchannel Allocation and Power Control in Licensed and Unlicensed Spectrum for Multi-Cell UAV-Cellular Network","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and 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":"University of Waterloo","funders":"Egyptian Cultural and Educational Bureau","keywords":"Computer science; Frequency allocation; Resource allocation; Power control; Optimization problem; Cellular network; Base station; Telecommunications link; Mathematical optimization; Transmitter power output; Computer network; Spectrum management; Resource management (computing); Convex optimization; Interference (communication); Cognitive radio; Power (physics); Regular polygon; Telecommunications; Algorithm; Wireless; Transmitter; Channel (broadcasting)","score_opus":0.022320578753568243,"score_gpt":0.23821359140589488,"score_spread":0.21589301265232663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170970335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060607366,0.0005012406,0.9360467,0.00013484212,0.00003013507,0.00004203742,0.000034292538,0.00006854712,0.0025349644],"genre_scores_gemma":[0.9508581,0.00027616142,0.047085565,0.00005547839,0.000027795137,0.000059635702,0.000034835426,0.000017269704,0.0015851737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934405,0.00022004098,0.000021425127,0.0001363281,0.00012478356,0.00015338878],"domain_scores_gemma":[0.99948275,0.00027894482,0.00008567049,0.000036114037,0.0000749598,0.000041520645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038564,0.000798567,0.00081720285,0.00027708837,0.00043089173,0.0008837138,0.0008755149,0.0006498258,0.00072042807],"category_scores_gemma":[0.0011920745,0.00027390284,0.00039618544,0.0006156446,0.0006663723,0.00096839754,0.0007519937,0.0005392513,0.00011306077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000809889,0.000059318103,0.00076539064,0.00006194966,0.000042397427,0.00018768183,0.000073144074,0.9620314,0.004059541,0.010158372,0.0005012391,0.021978587],"study_design_scores_gemma":[0.0000043657205,0.000020997386,0.00009187985,0.000001607821,0.0000063096054,0.000019304076,0.000017357168,0.997494,0.0005591525,0.0016153129,0.00016707665,0.0000026897653],"about_ca_topic_score_codex":0.005479597,"about_ca_topic_score_gemma":0.004520164,"teacher_disagreement_score":0.005479597,"about_ca_system_score_codex":0.00088363205,"about_ca_system_score_gemma":0.0008262974,"threshold_uncertainty_score":0.010895431},"labels":[],"label_agreement":null},{"id":"W3171596153","doi":"10.1109/jsac.2021.3087272","title":"LOSP: Overlap Synchronization Parallel With Local Compensation for Fast Distributed Training","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Stochastic Gradient Optimization 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 Waterloo","funders":"National Key Research and Development Program of China; Research Grants Council, University Grants Committee; China Postdoctoral Science Foundation; Impact Fund; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Synchronization (alternating current); Computation; Speedup; Distributed computing; Overhead (engineering); Convergence (economics); Stochastic gradient descent; Rate of convergence; Compensation (psychology); Data synchronization; Mathematical optimization; Parallel computing; Algorithm; Key (lock); Computer network; Artificial intelligence; Artificial neural network","score_opus":0.03917666790837083,"score_gpt":0.2856775653390298,"score_spread":0.246500897430659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171596153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015163686,0.00017836492,0.98099935,0.00015159001,0.00007492608,0.00005253585,0.00003211939,0.0022101414,0.0011372672],"genre_scores_gemma":[0.600266,0.00022640244,0.39264053,0.00030856475,0.00015439531,0.00035782903,0.00036380804,0.00046275684,0.0052196956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930155,0.00016032116,0.000043090142,0.00018175674,0.00021766798,0.000095625466],"domain_scores_gemma":[0.99916685,0.0002910636,0.00008847619,0.00022212598,0.00014327532,0.000088140834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224995,0.0009177732,0.0011358643,0.00035554013,0.00058847334,0.0005875189,0.0018152257,0.000765622,0.0024227004],"category_scores_gemma":[0.0024405618,0.0004259979,0.00045617434,0.00058393733,0.00069783954,0.0013345045,0.002022063,0.0013286498,0.00081707316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007896101,0.00032087765,0.0020733816,0.00022182394,0.000098434146,0.00023555153,0.00028297133,0.5344444,0.01943559,0.012286129,0.010970029,0.41884118],"study_design_scores_gemma":[0.00005733607,0.0000759518,0.00016867397,0.000004554687,0.000007845612,0.00003037879,0.000015526404,0.99411327,0.0023911046,0.0018850169,0.0012435092,0.000006783695],"about_ca_topic_score_codex":0.0039568334,"about_ca_topic_score_gemma":0.0051116385,"teacher_disagreement_score":0.0039568334,"about_ca_system_score_codex":0.00046097508,"about_ca_system_score_gemma":0.0022081672,"threshold_uncertainty_score":0.008104682},"labels":[],"label_agreement":null},{"id":"W3172135703","doi":"10.1109/jsac.2021.3087250","title":"Radio Frequency Fingerprint Identification for LoRa Using Deep Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":259,"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; Royal Society","keywords":"Computer science; Deep learning; Spectrogram; Artificial intelligence; Universal Software Radio Peripheral; Carrier frequency offset; Multilayer perceptron; Convolutional neural network; Wireless; Time–frequency analysis; Artificial neural network; Pattern recognition (psychology); Speech recognition; Machine learning; Frequency offset; Orthogonal frequency-division multiplexing; Filter (signal processing); Telecommunications; Computer vision; Channel (broadcasting)","score_opus":0.06964920209736099,"score_gpt":0.32293040587492877,"score_spread":0.2532812037775678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172135703","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.07278154,0.0012869047,0.9174012,0.00035544063,0.00010928996,0.00006585697,0.00024617225,0.0035086775,0.0042449106],"genre_scores_gemma":[0.8566751,0.00064990384,0.13477579,0.00030347804,0.00005375474,0.00008176008,0.0005624277,0.000056637233,0.0068411655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996848,0.000044598535,0.000015663145,0.00007627615,0.000121518686,0.000057124056],"domain_scores_gemma":[0.9996669,0.00007891884,0.00007058996,0.000055330176,0.00010876622,0.000019496265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004369042,0.0007319747,0.000544255,0.00068978965,0.00023662555,0.0005555024,0.0007571432,0.00063399883,0.0017521256],"category_scores_gemma":[0.0011354267,0.00021568808,0.00039741574,0.0005241103,0.00026188028,0.0009480326,0.0009390093,0.0007437755,0.0010676902],"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.00021498046,0.0001755674,0.0059597013,0.00014916818,0.00008391311,0.00016449143,0.00006456719,0.10714334,0.03665595,0.0023679074,0.0040536225,0.8429668],"study_design_scores_gemma":[0.000006799923,0.00009771716,0.0018625741,0.000019352712,0.000020675905,0.00011304212,0.00002400227,0.98110676,0.012592727,0.0015573011,0.0025837242,0.00001537916],"about_ca_topic_score_codex":0.0023484342,"about_ca_topic_score_gemma":0.003186396,"teacher_disagreement_score":0.0023484342,"about_ca_system_score_codex":0.0004942137,"about_ca_system_score_gemma":0.00046942846,"threshold_uncertainty_score":0.005861461},"labels":[],"label_agreement":null},{"id":"W3193402397","doi":"10.1109/jsac.2022.3145909","title":"Multi-Dimensional Multiple Access With Resource Utilization Cost Awareness for Individualized Service Provisioning in 6G","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced 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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; User equipment; Quality of service; Computer network; Resource allocation; Provisioning; Base station; Resource management (computing); Wireless; Radio resource management; Wireless network; Telecommunications","score_opus":0.11192588286735144,"score_gpt":0.35442236404329547,"score_spread":0.24249648117594402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193402397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010170754,0.0006649178,0.9861389,0.00024643185,0.000039908635,0.000032145446,0.000018811006,0.00007573472,0.0026124467],"genre_scores_gemma":[0.7805185,0.0018242171,0.21438162,0.00017273705,0.00014347277,0.00016016387,0.0000851252,0.000045776345,0.0026684399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917513,0.0003475749,0.000026589643,0.00008707781,0.0002683682,0.00009526686],"domain_scores_gemma":[0.9995541,0.00024177684,0.000061814324,0.000040845858,0.00007457489,0.000026824055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010403795,0.000736795,0.0007906635,0.0004335075,0.0004032391,0.00096161634,0.0007919057,0.00062507676,0.0010381393],"category_scores_gemma":[0.0019841546,0.0003579811,0.0005753126,0.0008219151,0.00058034447,0.001146332,0.0011737696,0.0012688374,0.00021652486],"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.00006745538,0.00008139777,0.00053166825,0.00011710105,0.00005243935,0.00012709394,0.00007938793,0.8707892,0.0051167323,0.054412384,0.0021094722,0.06651581],"study_design_scores_gemma":[0.0000025893928,0.000013709611,0.000045145716,0.0000029119494,0.000004873445,0.000017197164,0.0000073681767,0.9957795,0.00030387152,0.0034127343,0.0004057072,0.000004376864],"about_ca_topic_score_codex":0.0019368791,"about_ca_topic_score_gemma":0.0023634217,"teacher_disagreement_score":0.0019368791,"about_ca_system_score_codex":0.000772342,"about_ca_system_score_gemma":0.0010139892,"threshold_uncertainty_score":0.0056037307},"labels":[],"label_agreement":null},{"id":"W3194020564","doi":"10.1109/jsac.2022.3143259","title":"Efficient Federated Meta-Learning Over Multi-Access Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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 Waterloo","funders":"National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Wireless network; Wireless; Distributed computing; Telecommunications","score_opus":0.09115092014906082,"score_gpt":0.340569195504713,"score_spread":0.24941827535565217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194020564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034543883,0.00040317466,0.9625508,0.00035796093,0.000037671958,0.000060640185,0.000057919362,0.00048158705,0.0015062958],"genre_scores_gemma":[0.85516644,0.00022452317,0.14213425,0.00019562559,0.000041432642,0.00024532218,0.0001504056,0.000086696135,0.0017553692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885964,0.00047876578,0.00006861781,0.00020758504,0.00015888465,0.00022659075],"domain_scores_gemma":[0.997332,0.001836646,0.00023484026,0.00022412547,0.00022442534,0.00014801447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027157331,0.0015336601,0.0020214624,0.000655806,0.000736643,0.0014589237,0.0019272811,0.0019240709,0.0015718678],"category_scores_gemma":[0.004851341,0.0007882422,0.0011573981,0.0008601602,0.0011164072,0.0020945559,0.0022637642,0.0019495015,0.00025631048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055372915,0.000032456705,0.00026056715,0.000030320478,0.000030977375,0.00002706524,0.000023773158,0.98371214,0.00025866542,0.003364134,0.00022351749,0.011981105],"study_design_scores_gemma":[0.000007633622,0.000012500868,0.000015542395,0.0000028517527,0.0000041288013,0.0000034911093,0.000004014726,0.99702376,0.0001238846,0.0027397173,0.00006095839,0.0000014088714],"about_ca_topic_score_codex":0.0037260905,"about_ca_topic_score_gemma":0.003613928,"teacher_disagreement_score":0.0037260905,"about_ca_system_score_codex":0.0014959915,"about_ca_system_score_gemma":0.0017806557,"threshold_uncertainty_score":0.014362335},"labels":[],"label_agreement":null},{"id":"W3195867781","doi":"10.1109/jsac.2021.3094600","title":"Guest Editorial Latest Advances in Optical Networks for 5G Communications and Beyond","year":2021,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":4,"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, Davis; University of Waterloo","keywords":"Computer science; Telecommunications; Field (mathematics); Computer network; Data science","score_opus":0.014445757960225328,"score_gpt":0.30368581161782526,"score_spread":0.2892400536575999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195867781","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005499366,0.0037798104,0.00012139663,0.011497238,0.98141026,0.000018838633,0.000046584508,0.000042990665,0.00302791],"genre_scores_gemma":[0.00044268926,0.0052173017,0.000093888855,0.0054281806,0.97281104,0.000016815871,0.000042337066,0.000040189843,0.015907569],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978404,0.00020966124,0.00022311343,0.00027980583,0.0012496755,0.00019720453],"domain_scores_gemma":[0.99089324,0.0018261414,0.00052912126,0.00020545571,0.0049301614,0.0016159341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031485192,0.0024173488,0.0020196086,0.002813196,0.0018758597,0.0049393796,0.0016674268,0.0046926406,0.026043221],"category_scores_gemma":[0.008772883,0.0005734709,0.0013431003,0.0011185042,0.00084077317,0.0030406844,0.001099353,0.008442457,0.020544631],"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.000038930564,0.000013156164,0.00002191591,0.00020532573,0.0000070666633,0.000099004435,0.0000104954315,0.000021167696,0.00014100503,0.00036165913,0.9904695,0.008610724],"study_design_scores_gemma":[0.000026001651,0.00003148749,0.0001586238,0.00023007941,0.000018009032,0.00023105835,0.000033896635,0.000078613644,0.00017528192,0.0006895044,0.998317,0.000010370644],"about_ca_topic_score_codex":0.0004243681,"about_ca_topic_score_gemma":0.0011317418,"teacher_disagreement_score":0.026043221,"about_ca_system_score_codex":0.0012607949,"about_ca_system_score_gemma":0.0015956325,"threshold_uncertainty_score":0.087123215},"labels":[],"label_agreement":null},{"id":"W3205260830","doi":"10.1109/jsac.2021.3118352","title":"Optimizing Federated Learning in Distributed Industrial IoT: A Multi-Agent Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":288,"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 Windsor; University of Waterloo","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Internet of Things; Distributed computing; Distributed learning; Artificial intelligence; World Wide Web","score_opus":0.11912088820383555,"score_gpt":0.3230193121981485,"score_spread":0.20389842399431296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205260830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030634673,0.00018916964,0.9666617,0.00037602548,0.000040293293,0.000052777974,0.00002455064,0.00026810434,0.001752754],"genre_scores_gemma":[0.91412085,0.000120640914,0.0836273,0.00016901657,0.00004247842,0.0000910562,0.000037359914,0.000036584373,0.0017547979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919945,0.00027580513,0.000035568544,0.00019871391,0.00014483379,0.00014554564],"domain_scores_gemma":[0.9982096,0.0009358432,0.00028797862,0.00016478579,0.00026576908,0.00013609233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019448041,0.0010780488,0.0015384803,0.00050282007,0.00059445784,0.0011266924,0.0018011858,0.0016568762,0.0010012568],"category_scores_gemma":[0.0031265216,0.00048262565,0.00052485795,0.00047450722,0.0012772767,0.0014636404,0.0014611378,0.0011974119,0.00014078089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031833628,0.000039203936,0.0002593839,0.000015823442,0.000023326858,0.000041786574,0.00001608035,0.98893225,0.00038090002,0.0028946095,0.0001974352,0.0071674907],"study_design_scores_gemma":[0.0000058296328,0.000009793646,0.000024376233,0.0000014261764,0.0000027443198,0.0000033646754,0.000004158296,0.9980094,0.00011288948,0.0017537713,0.00007070138,0.0000015160589],"about_ca_topic_score_codex":0.00438971,"about_ca_topic_score_gemma":0.004371006,"teacher_disagreement_score":0.00438971,"about_ca_system_score_codex":0.0012379804,"about_ca_system_score_gemma":0.0014081991,"threshold_uncertainty_score":0.010285258},"labels":[],"label_agreement":null},{"id":"W3206341804","doi":"10.1109/jsac.2021.3119144","title":"Buffer-Aware Virtual Reality Video Streaming With Personalized and Private Viewport Prediction","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Image and Video Quality Assessment","field":"Computer Science","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":"Carleton University","funders":"National Key Research and Development Program of China","keywords":"Viewport; Computer science; Virtual reality; Video streaming; Buffer (optical fiber); Multimedia; Computer network; Computer graphics (images); Human–computer interaction; Telecommunications","score_opus":0.04789369017192728,"score_gpt":0.3278742425291593,"score_spread":0.279980552357232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206341804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06765067,0.0002709368,0.92870957,0.00017098204,0.000046310026,0.00004517733,0.000099847144,0.0014199488,0.0015866192],"genre_scores_gemma":[0.9203824,0.00011602897,0.07774839,0.00008642547,0.00002483846,0.000044655706,0.00018026121,0.000055856806,0.0013612432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995146,0.00007833361,0.000022204304,0.00017633621,0.00012879755,0.00007974997],"domain_scores_gemma":[0.9992399,0.00030226444,0.00009006637,0.00013456527,0.00015872791,0.00007447662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006847643,0.00064786547,0.0009773602,0.0003424361,0.00032996235,0.0006881465,0.001789447,0.0006609301,0.0011991903],"category_scores_gemma":[0.0025253333,0.00037786117,0.00044353903,0.0003677799,0.00036195546,0.0015372824,0.0010416895,0.0010011742,0.00027765534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045910178,0.00024564634,0.003763195,0.0000675958,0.000057710542,0.00017125557,0.000121293226,0.78101444,0.013585209,0.0044488036,0.0023862233,0.19367948],"study_design_scores_gemma":[0.0000057773873,0.00002162034,0.00014802902,0.000001575337,0.0000035579535,0.000018528111,0.0000053432764,0.998021,0.00096503587,0.0006934376,0.00011269889,0.0000034364252],"about_ca_topic_score_codex":0.0058629056,"about_ca_topic_score_gemma":0.005381887,"teacher_disagreement_score":0.0058629056,"about_ca_system_score_codex":0.0006018107,"about_ca_system_score_gemma":0.00084756047,"threshold_uncertainty_score":0.011657536},"labels":[],"label_agreement":null},{"id":"W3210260041","doi":"10.1109/jsac.2022.3196320","title":"Antenna Array Enabled Space/Air/Ground Communications and Networking for 6G","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":121,"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); Memorial University of Newfoundland","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Beamforming; Telecommunications; Wireless; Communications system; Antenna array; Antenna (radio); Electronic engineering; Electrical engineering; Engineering","score_opus":0.03539496937769199,"score_gpt":0.26721727149079666,"score_spread":0.23182230211310467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210260041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020730859,0.08726626,0.74426955,0.0042251693,0.0025241587,0.000098881705,0.00032114697,0.001245187,0.13931873],"genre_scores_gemma":[0.5281979,0.12973179,0.27473253,0.0033214833,0.0032785023,0.00026283832,0.0008475305,0.00017627106,0.059451137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997882,0.00004834299,0.000011368147,0.000036993184,0.00008412831,0.000030991876],"domain_scores_gemma":[0.99984753,0.000043565648,0.000023577039,0.000018823572,0.000052613937,0.000013922798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022913216,0.00061648455,0.00029309522,0.00041476087,0.0002682986,0.0010047288,0.0004625623,0.00092609803,0.004782375],"category_scores_gemma":[0.00029042902,0.0001542692,0.0003326997,0.0006472854,0.0003169517,0.0013911494,0.0006864242,0.0011763782,0.0023297223],"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.00012257145,0.00006110256,0.0022560568,0.0011535367,0.0000721457,0.0007055619,0.00026419893,0.022887066,0.10220882,0.21809347,0.035712168,0.6164633],"study_design_scores_gemma":[0.000015735388,0.00062455883,0.002170819,0.00036824943,0.00009480247,0.0030361635,0.00026651882,0.10929801,0.028808165,0.046971977,0.80825126,0.00009375394],"about_ca_topic_score_codex":0.00034236492,"about_ca_topic_score_gemma":0.0006327218,"teacher_disagreement_score":0.004782375,"about_ca_system_score_codex":0.00041277884,"about_ca_system_score_gemma":0.0002643399,"threshold_uncertainty_score":0.015998662},"labels":[],"label_agreement":null},{"id":"W3212036903","doi":"10.1109/jsac.2021.3126057","title":"A Hierarchical Incentive Design Toward Motivating Participation in Coded Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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":"BC Research (Canada); University of British Columbia","funders":"Ministry of Education; Ministry of Science and ICT, South Korea; Singapore University of Technology and Design; Neurosciences Research Foundation; American Institutes for Research","keywords":"Computer science; Incentive; Coding (social sciences); Computation; Artificial intelligence","score_opus":0.0994461860795624,"score_gpt":0.3482428008676542,"score_spread":0.24879661478809179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212036903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028854107,0.000077080585,0.9676422,0.00049635605,0.00004537202,0.00015870015,0.000057235015,0.0002882068,0.0023808975],"genre_scores_gemma":[0.85151154,0.00009049133,0.14429149,0.00026310066,0.00003982923,0.00032681122,0.00006792726,0.000051556715,0.0033573161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958274,0.001850208,0.00017693381,0.0008954379,0.00066684745,0.00058326084],"domain_scores_gemma":[0.99191064,0.004107341,0.000780262,0.001083813,0.0010858816,0.0010320687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056071803,0.0008784767,0.0012116347,0.0005743508,0.0009717493,0.0016296757,0.0037237816,0.0016982824,0.0040825815],"category_scores_gemma":[0.01839039,0.00052896544,0.0006158588,0.0007666839,0.0017836562,0.0036625806,0.0039313887,0.0021658498,0.00043373404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010175362,0.00066065346,0.0025458885,0.0003114055,0.000095635536,0.0005436823,0.00075528614,0.5853867,0.0081859045,0.2727007,0.0047399364,0.12305672],"study_design_scores_gemma":[0.000060269125,0.000082072074,0.0001308783,0.000015522312,0.000010696444,0.00006131972,0.000045467415,0.94444853,0.001039888,0.05296865,0.0011232637,0.000013422031],"about_ca_topic_score_codex":0.0013610156,"about_ca_topic_score_gemma":0.0013302921,"teacher_disagreement_score":0.0056071803,"about_ca_system_score_codex":0.0012694093,"about_ca_system_score_gemma":0.0028644702,"threshold_uncertainty_score":0.029653907},"labels":[],"label_agreement":null},{"id":"W3213057597","doi":"10.1109/jsac.2021.3126074","title":"Efficient Residual Shrinkage CNN Denoiser Design for Intelligent Signal Processing: Modulation Recognition, Detection, and Decoding","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Signal Modulation Classification","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Noise reduction; Decoding methods; Artificial intelligence; Signal processing; Speech recognition; Pattern recognition (psychology); Algorithm; Digital signal processing","score_opus":0.09451946008476451,"score_gpt":0.3089147766821053,"score_spread":0.2143953165973408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213057597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014395321,0.00020280066,0.9831082,0.000089359055,0.000056265726,0.00003607582,0.0000369872,0.00040502133,0.0016697908],"genre_scores_gemma":[0.4725054,0.00051461166,0.5186284,0.00024087861,0.00007242817,0.00013064191,0.00035343456,0.00014928285,0.007404895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964154,0.000044743538,0.00002547191,0.00008680414,0.00015598437,0.000045456505],"domain_scores_gemma":[0.99965775,0.000062019266,0.00003758155,0.000055000753,0.00017172426,0.000015981406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070975866,0.0007951993,0.00046380324,0.0004250327,0.00026130365,0.0006009209,0.0008620638,0.000718053,0.0011695509],"category_scores_gemma":[0.0015540776,0.00029138647,0.0004705265,0.00035636828,0.00048519677,0.0008965169,0.00063978136,0.00096567586,0.00053321995],"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.00043680056,0.00012070823,0.002480644,0.0002459609,0.00011693865,0.00022341602,0.00015227564,0.280727,0.26859564,0.014719962,0.0043472373,0.42783344],"study_design_scores_gemma":[0.000015389971,0.00007043318,0.00055848237,0.000015521418,0.00003126002,0.00011470199,0.000017973218,0.91590506,0.07771193,0.0018098099,0.0037285194,0.00002097058],"about_ca_topic_score_codex":0.0031010483,"about_ca_topic_score_gemma":0.0064069587,"teacher_disagreement_score":0.0031010483,"about_ca_system_score_codex":0.0004722961,"about_ca_system_score_gemma":0.00069193146,"threshold_uncertainty_score":0.0061659813},"labels":[],"label_agreement":null},{"id":"W4205407795","doi":"10.1109/jsac.2022.3143211","title":"RIS-Assisted Joint Transmission in a Two-Cell Downlink NOMA Cellular System","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Concordia University","keywords":"Telecommunications link; Computer science; Base station; Optimization problem; Noma; Transmission (telecommunications); Mathematical optimization; Interference (communication); Convex optimization; Enhanced Data Rates for GSM Evolution; Single antenna interference cancellation; Linear programming; Computer network; Algorithm; Regular polygon; Telecommunications; Mathematics","score_opus":0.02638300017207069,"score_gpt":0.26026325917871335,"score_spread":0.23388025900664267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205407795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28569007,0.0007028259,0.7013199,0.00035243543,0.000102078506,0.00006658694,0.00008212468,0.00028391264,0.011400149],"genre_scores_gemma":[0.9796459,0.000112467635,0.018380664,0.00004480904,0.000026436728,0.000033742224,0.000023030876,0.000007402949,0.0017255961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.000248121,0.000014633731,0.000096838485,0.00012777282,0.00013053505],"domain_scores_gemma":[0.9996853,0.00011203226,0.00005713694,0.00003624046,0.00006920312,0.0000401005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047245368,0.0007021758,0.0006759069,0.00019897753,0.00034984556,0.0008671857,0.0006975161,0.0006634504,0.0006131019],"category_scores_gemma":[0.00071956037,0.00029774717,0.00040499095,0.00045836967,0.00062298676,0.000601348,0.000995423,0.00060384575,0.00021521866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020119309,0.00007030695,0.0014121501,0.0000712387,0.000067563444,0.0005265655,0.0001182593,0.9550428,0.014204041,0.0076516983,0.0005532354,0.020080991],"study_design_scores_gemma":[0.000009600984,0.000074113326,0.00019454717,0.0000024214535,0.00001540843,0.000052827734,0.000020087567,0.9976342,0.0011144887,0.0006046298,0.0002704892,0.000007189331],"about_ca_topic_score_codex":0.002931333,"about_ca_topic_score_gemma":0.003513199,"teacher_disagreement_score":0.002931333,"about_ca_system_score_codex":0.00046901178,"about_ca_system_score_gemma":0.0005105574,"threshold_uncertainty_score":0.0058285},"labels":[],"label_agreement":null},{"id":"W4205426731","doi":"10.1109/jsac.2022.3143220","title":"Interference Nulling Using Reconfigurable Intelligent Surface","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":93,"is_retracted":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":"Huawei Technologies","keywords":"Interference (communication); Projection (relational algebra); Channel (broadcasting); Computer science; Null (SQL); Topology (electrical circuits); Transceiver; Notation; Mathematical notation; Algorithm; Mathematics; Wireless; Combinatorics; Telecommunications; Database; Arithmetic","score_opus":0.06788044082274267,"score_gpt":0.30271049559959246,"score_spread":0.2348300547768498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205426731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36974102,0.0008682203,0.5865056,0.000214088,0.00013578587,0.000038252056,0.000032687556,0.0010792704,0.04138511],"genre_scores_gemma":[0.9519514,0.0001946059,0.044650875,0.00006045876,0.000025666122,0.000023942675,0.000033525543,0.00004819329,0.0030113326],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996716,0.000051419822,0.000009452137,0.000053108048,0.00015179673,0.00006263383],"domain_scores_gemma":[0.9996282,0.00011748408,0.000079993966,0.00007944156,0.000063797794,0.000031189644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020300089,0.0005901291,0.00046152595,0.00039417672,0.00025367778,0.0007994884,0.00068319956,0.00054238475,0.0012456474],"category_scores_gemma":[0.0006191762,0.00019011526,0.00045072808,0.00035652902,0.00090783555,0.0008827333,0.0007307373,0.00039786837,0.0005017278],"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.0005734675,0.00012873937,0.0022588852,0.00022693585,0.00009357944,0.00057110406,0.0003512638,0.26572272,0.5428338,0.055097293,0.00094893476,0.13119328],"study_design_scores_gemma":[0.00005285986,0.00078725256,0.0013574875,0.00002032235,0.000042755444,0.00044718164,0.00014426497,0.8274982,0.14861025,0.011908792,0.009069154,0.00006158281],"about_ca_topic_score_codex":0.0002784963,"about_ca_topic_score_gemma":0.00016423462,"teacher_disagreement_score":0.0012456474,"about_ca_system_score_codex":0.00040167302,"about_ca_system_score_gemma":0.00021987117,"threshold_uncertainty_score":0.00416708},"labels":[],"label_agreement":null},{"id":"W4210439023","doi":"10.1109/jsac.2022.3145234","title":"Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":551,"is_retracted":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 Manitoba","funders":"","keywords":"Noma; Computer science; Telecommunications link; Wireless; Computer network; Wireless network; Physical layer; Flexibility (engineering); Distributed computing; Telecommunications","score_opus":0.12048537971916876,"score_gpt":0.3249627518277547,"score_spread":0.20447737210858594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210439023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012636923,0.066401504,0.8479201,0.0062228497,0.0024547162,0.00018190505,0.00028495377,0.00044410964,0.06345299],"genre_scores_gemma":[0.5046118,0.10751269,0.3560281,0.0052174567,0.005947466,0.00087433594,0.0005291264,0.00015273658,0.01912626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988558,0.00046762568,0.00006223579,0.0001446624,0.00033156303,0.00013802348],"domain_scores_gemma":[0.9987417,0.0005989224,0.0001247646,0.00014087453,0.0003277678,0.00006598829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014006897,0.000894568,0.0006705927,0.0010348433,0.0009477048,0.0020773427,0.0010965012,0.001612021,0.0026036657],"category_scores_gemma":[0.0027953894,0.0003895446,0.0005672443,0.0011445578,0.0014249376,0.002578395,0.0020012455,0.003280391,0.0011336391],"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.000080907055,0.000050702438,0.00083395076,0.0007019811,0.00004647927,0.0005059899,0.00043931595,0.022501022,0.006529059,0.7693556,0.01155088,0.18740411],"study_design_scores_gemma":[0.000028681603,0.00037116557,0.0009780822,0.00078272144,0.00007360339,0.0016056648,0.0003663615,0.20190902,0.0037677623,0.36064452,0.42933595,0.00013647505],"about_ca_topic_score_codex":0.0020572355,"about_ca_topic_score_gemma":0.0023389293,"teacher_disagreement_score":0.0026036657,"about_ca_system_score_codex":0.0012329826,"about_ca_system_score_gemma":0.0013896696,"threshold_uncertainty_score":0.008945942},"labels":[],"label_agreement":null},{"id":"W4212792399","doi":"10.1109/jsac.2019.2938456","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement Systems","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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212792399","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4214828252","doi":"10.1109/jsac.2022.3155496","title":"Active Sensing for Communications by Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization Technologies","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 Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Computer science; Channel state information; Frame (networking); Wireless; Channel (broadcasting); Deep learning; Beamforming; Artificial intelligence; Exploit; Machine learning; Telecommunications","score_opus":0.02444263985850341,"score_gpt":0.27502468229122135,"score_spread":0.2505820424327179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214828252","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.0034403114,0.0012761289,0.990567,0.00065327174,0.00012508439,0.0000181535,0.000031214007,0.00018137226,0.0037074292],"genre_scores_gemma":[0.737065,0.004370167,0.24261773,0.0011780683,0.00067737803,0.00027542617,0.00020197783,0.00014500781,0.013469248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.00018649682,0.000030480473,0.00014086207,0.00018544987,0.00006493496],"domain_scores_gemma":[0.9986846,0.00089551293,0.00009872,0.00013912182,0.00014507066,0.000036903253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331894,0.0009384852,0.00074800407,0.00039839308,0.00038513687,0.001278755,0.0013111358,0.0015660438,0.0029123724],"category_scores_gemma":[0.00341352,0.00040890466,0.00052733364,0.0005752213,0.0017423658,0.00270595,0.0015448852,0.0023202202,0.0004612663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014437403,0.00006402418,0.0005099327,0.00028937715,0.00008128494,0.000104347746,0.000154091,0.601758,0.0064963396,0.24874651,0.0049711927,0.13668053],"study_design_scores_gemma":[0.000009334372,0.000027748347,0.000053945845,0.000019112782,0.000006661312,0.000021476602,0.000010587524,0.93640876,0.0009652682,0.059452713,0.0030153026,0.000009154885],"about_ca_topic_score_codex":0.0022639493,"about_ca_topic_score_gemma":0.0020087834,"teacher_disagreement_score":0.0029123724,"about_ca_system_score_codex":0.0009213757,"about_ca_system_score_gemma":0.0007573709,"threshold_uncertainty_score":0.009742856},"labels":[],"label_agreement":null},{"id":"W4214847706","doi":"10.1109/jsac.2022.3143255","title":"Joint Activity and Blind Information Detection for UAV-Assisted Massive IoT Access","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication 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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Internet of Things; Computer network; Computer security; Telecommunications","score_opus":0.05573457718618513,"score_gpt":0.3082544847560607,"score_spread":0.2525199075698756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214847706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098235324,0.00069252995,0.89602494,0.00039699345,0.00018985457,0.000035696237,0.00017194827,0.00035489944,0.0038977761],"genre_scores_gemma":[0.94953114,0.0003960373,0.046034485,0.000105403626,0.00010856794,0.000026579495,0.00018338767,0.000024474319,0.0035899351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00009553264,0.000019680649,0.00008671957,0.00011777698,0.000096098265],"domain_scores_gemma":[0.99934,0.00033376514,0.0000867883,0.000059759066,0.00013310007,0.000046499506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042753344,0.00070276624,0.0007938297,0.00037786821,0.00032667766,0.00071710354,0.00045796612,0.00070713804,0.0009894907],"category_scores_gemma":[0.0024640337,0.0002718512,0.0003737174,0.0005226939,0.00050304946,0.00095370435,0.0012277693,0.0006564007,0.00034532414],"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.0019558256,0.0002827989,0.011993089,0.00043529208,0.0002243147,0.0013053046,0.0004460671,0.38804486,0.13145487,0.02678218,0.005679174,0.43139625],"study_design_scores_gemma":[0.000008725302,0.000089222776,0.0016846979,0.0000121156845,0.000020412148,0.0002708004,0.000045822642,0.9864579,0.0066559995,0.004117713,0.0006207332,0.000015820076],"about_ca_topic_score_codex":0.0015024042,"about_ca_topic_score_gemma":0.0023172407,"teacher_disagreement_score":0.0015024042,"about_ca_system_score_codex":0.0002625588,"about_ca_system_score_gemma":0.000581236,"threshold_uncertainty_score":0.0033102036},"labels":[],"label_agreement":null},{"id":"W4214866728","doi":"10.1109/jsac.2022.3155515","title":"Generalized Transceiver Beamforming for DFRC With MIMO Radar and MU-MIMO Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Radar Systems and Signal Processing","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":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Beamforming; MIMO; Computer science; 3G MIMO; Radar; Electronic engineering; Telecommunications; Engineering","score_opus":0.022068869011231916,"score_gpt":0.2499649836866108,"score_spread":0.22789611467537887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214866728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026884153,0.00024914736,0.9945498,0.000071575996,0.000030993895,0.000015294416,0.00001837908,0.00006226285,0.002314193],"genre_scores_gemma":[0.50183,0.0019193758,0.48926058,0.00038690638,0.00023195219,0.00030115937,0.00016921824,0.000053029788,0.0058477786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991623,0.00031127472,0.000034717137,0.00015323078,0.00025874606,0.00007977022],"domain_scores_gemma":[0.9995504,0.00015530224,0.00006909645,0.00005689538,0.00015037315,0.000017933598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065877533,0.0011475086,0.0006476359,0.00027689055,0.0002768124,0.0006073461,0.0005632363,0.0008308443,0.0018970257],"category_scores_gemma":[0.0011651692,0.00030096908,0.0005163697,0.0007123621,0.0004478052,0.00075863244,0.0005709858,0.00072426576,0.0008467565],"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.00016345634,0.00008144336,0.00093745516,0.0005620095,0.00011876231,0.0003721631,0.00022649848,0.51656413,0.06989861,0.14824446,0.005035958,0.25779504],"study_design_scores_gemma":[0.000023071367,0.00020514651,0.00028474603,0.000034008062,0.000030053481,0.00029758344,0.000041537056,0.9697602,0.007975742,0.014057397,0.007260445,0.000029986375],"about_ca_topic_score_codex":0.0006640529,"about_ca_topic_score_gemma":0.00084305316,"teacher_disagreement_score":0.0018970257,"about_ca_system_score_codex":0.0004147277,"about_ca_system_score_gemma":0.00055630493,"threshold_uncertainty_score":0.0063462257},"labels":[],"label_agreement":null},{"id":"W4220716396","doi":"10.1109/jsac.2022.3155523","title":"Rethinking Doppler Effect for Accurate Velocity Estimation With Commodity WiFi Devices","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":83,"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":"China Postdoctoral Science Foundation; Chinese Academy of Sciences; National Natural Science Foundation of China; Nanyang Technological University","keywords":"Computer science; Doppler effect; Telecommunications; Commodity; Estimation; Real-time computing","score_opus":0.030598049709833913,"score_gpt":0.28100655394572893,"score_spread":0.250408504235895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220716396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01909438,0.0003277727,0.97816944,0.00015614412,0.00009575369,0.000032360957,0.00004161761,0.00084230106,0.0012401527],"genre_scores_gemma":[0.5480178,0.0006237584,0.44896477,0.00014516558,0.00013779095,0.000088139954,0.00014405059,0.000086943364,0.001791608],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990772,0.00023193043,0.000054205495,0.00016481172,0.00037081435,0.000101068996],"domain_scores_gemma":[0.9984738,0.0008372368,0.00012093289,0.000325369,0.00021037715,0.000032350625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009466661,0.00067350466,0.00070748315,0.000572882,0.00044278285,0.00087467604,0.0011025654,0.00085750106,0.001793757],"category_scores_gemma":[0.006119111,0.00041386118,0.0003473675,0.0006565208,0.00048027225,0.0019198194,0.0012460967,0.0011132143,0.0007553091],"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.0003623256,0.00009146438,0.006452315,0.0003690644,0.00008196969,0.0002684401,0.00035889758,0.1558597,0.103670515,0.026731016,0.0046060756,0.70114815],"study_design_scores_gemma":[0.00007110655,0.00024105761,0.0029436916,0.000061556486,0.000058341346,0.0004369338,0.00007928273,0.9315759,0.045917973,0.008883802,0.009653388,0.00007689279],"about_ca_topic_score_codex":0.0026337774,"about_ca_topic_score_gemma":0.0030629581,"teacher_disagreement_score":0.0026337774,"about_ca_system_score_codex":0.000425886,"about_ca_system_score_gemma":0.0006688846,"threshold_uncertainty_score":0.006000638},"labels":[],"label_agreement":null},{"id":"W4220901917","doi":"10.1109/jsac.2021.3139485","title":"Special Issue on Next Generation Multiple Access—Part I","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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 Waterloo; University of Manitoba","funders":"","keywords":"Computer science; Wireless network; Wireless; Computer network; Radio resource management; Code division multiple access; Next-generation network; Telecommunications","score_opus":0.09223136267715082,"score_gpt":0.3140766991530618,"score_spread":0.22184533647591098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220901917","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007117087,0.071901634,0.004634849,0.018931452,0.74970186,0.00044625025,0.0005932456,0.00053093745,0.1525481],"genre_scores_gemma":[0.0035162882,0.078518614,0.0016765894,0.012524011,0.7584739,0.00035334605,0.0010743107,0.00032044653,0.14354248],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984487,0.00018107105,0.00015685974,0.00031929152,0.0007261599,0.00016789032],"domain_scores_gemma":[0.99532735,0.0013403442,0.00034348926,0.00028730187,0.0019458765,0.0007555707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661988,0.0019405965,0.0022377796,0.0027726619,0.0015200279,0.005384039,0.0026097256,0.0057190075,0.073677815],"category_scores_gemma":[0.005392871,0.0006482932,0.0010885679,0.0018399215,0.001480224,0.0037223066,0.0015012875,0.0058738473,0.053723756],"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.00006584584,0.00008224994,0.0002709545,0.0007929042,0.000026093958,0.00030631616,0.00003424224,0.00025650326,0.00077102415,0.004328757,0.9095354,0.083529666],"study_design_scores_gemma":[0.000007709713,0.000055571956,0.00039585578,0.00039777748,0.000011376269,0.00044182473,0.00002102331,0.00030785208,0.00015814167,0.0017384017,0.9964489,0.0000155522],"about_ca_topic_score_codex":0.0011451816,"about_ca_topic_score_gemma":0.0013207601,"teacher_disagreement_score":0.073677815,"about_ca_system_score_codex":0.0014720676,"about_ca_system_score_gemma":0.0017559907,"threshold_uncertainty_score":0.24647683},"labels":[],"label_agreement":null},{"id":"W4223912276","doi":"10.1109/jsac.2021.3139737","title":"Guest Editorial Special Issue on Next Generation Multiple Access—Part II","year":2022,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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; University of Manitoba","funders":"Menzies Centre for Australian Studies, King's College London, University of London; School of Electronic Engineering and Computer Science, Queen Mary University of London; Beijing University of Posts and Telecommunications","keywords":"Computer science; Wireless network; Wireless; Computer network; Radio resource management; Code division multiple access; Next-generation network; Random access; Telecommunications","score_opus":0.05149761875525063,"score_gpt":0.31482988997143374,"score_spread":0.26333227121618313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223912276","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010073118,0.0060201474,0.00030465212,0.011789001,0.97541285,0.000041669547,0.000083083374,0.00008997078,0.006157823],"genre_scores_gemma":[0.0006269754,0.0069045313,0.00013978462,0.0064894706,0.97054535,0.0000306464,0.00008276596,0.000048587157,0.015131759],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980788,0.00019346912,0.00020337068,0.00039117894,0.0009035375,0.00022966044],"domain_scores_gemma":[0.99360484,0.0014471331,0.0004117014,0.0002302337,0.002857619,0.0014484435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021427344,0.00226611,0.0023985032,0.001922393,0.0017620618,0.0065681473,0.002502343,0.0075835763,0.06374672],"category_scores_gemma":[0.00696909,0.0007619569,0.0018111772,0.00091432134,0.0013885464,0.0036586537,0.00123276,0.00991808,0.034155816],"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.00009225197,0.000041383024,0.00008412633,0.00039262444,0.000018511428,0.00023279895,0.000014958522,0.00007369312,0.00035094883,0.000875633,0.97745025,0.02037297],"study_design_scores_gemma":[0.00003831672,0.00006595724,0.00032430512,0.00024206405,0.000023652578,0.0003906291,0.00003144018,0.00017755225,0.00027394423,0.0008808434,0.9975351,0.000016165815],"about_ca_topic_score_codex":0.000743913,"about_ca_topic_score_gemma":0.0011021323,"teacher_disagreement_score":0.06374672,"about_ca_system_score_codex":0.0016441332,"about_ca_system_score_gemma":0.0014962088,"threshold_uncertainty_score":0.21325403},"labels":[],"label_agreement":null},{"id":"W4230203497","doi":"10.1109/jsac.2019.2922465","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement Systems","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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230203497","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4230848083","doi":"10.1109/jsac.2014.04.cover3","title":"Staff List","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of Waterloo; Institut National de la Recherche Scientifique","funders":"King's College London; Universitat Pompeu Fabra; Drexel University; George Washington University; Jackson State University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04088030239093019,"score_gpt":0.3229360583233427,"score_spread":0.2820557559324125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230848083","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.0004453965,0.002848498,0.0060407314,0.010882332,0.030547692,0.0007917514,0.017438972,0.006896515,0.9241082],"genre_scores_gemma":[0.0008907567,0.0015245294,0.0013291643,0.0021192948,0.0024844683,0.00031431954,0.007471435,0.0011694012,0.98269665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978649,0.00026221972,0.00014873118,0.0002638344,0.0011905151,0.00026992217],"domain_scores_gemma":[0.97625136,0.0026857716,0.00069956883,0.0021092757,0.01283826,0.005415782],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002803384,0.0011720635,0.0021653138,0.0063037043,0.002592482,0.006876085,0.0027768684,0.0026561085,0.91748667],"category_scores_gemma":[0.02554816,0.0006071488,0.00091947045,0.004359949,0.00061286875,0.0036069246,0.0033821838,0.0023072273,0.93088377],"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.00001564475,0.000020570362,0.00005401638,0.0001172363,0.000001556251,0.000013252794,0.000007867222,0.000039100745,0.000099360805,0.00089210074,0.95718724,0.041552052],"study_design_scores_gemma":[0.000012322188,0.000019382434,0.00014811671,0.00017232793,0.0000039241013,0.000031920325,0.00003130956,0.000111653375,0.00014927925,0.0012509177,0.9980609,0.000007938537],"about_ca_topic_score_codex":0.0022439673,"about_ca_topic_score_gemma":0.003894906,"teacher_disagreement_score":0.08251333,"about_ca_system_score_codex":0.0014036802,"about_ca_system_score_gemma":0.005652828,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4232058940","doi":"10.1109/jsac.2020.3018975","title":"Guest Editorial Massive Access for 5G and Beyond—Part I","year":2021,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","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":"Natural Science Foundation of Zhejiang Province; University of New South Wales; Australian Research Council; Digital Grid Futures Institute, University of New South Wales Canberra; National Science and Technology Major Project; National Natural Science Foundation of China","keywords":"Computer science; Telecommunications; Wireless","score_opus":0.03274890403319378,"score_gpt":0.3372209805872697,"score_spread":0.3044720765540759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232058940","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052363885,0.0029205857,0.00015351245,0.017026586,0.97774917,0.000018109215,0.00003952943,0.000044865046,0.0019952965],"genre_scores_gemma":[0.0005772383,0.0033279157,0.00010042033,0.008073539,0.9791373,0.000017228393,0.000028538898,0.000034935587,0.008702839],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758506,0.00022166944,0.00030797833,0.0003604285,0.0013350714,0.00018966832],"domain_scores_gemma":[0.9858832,0.003211666,0.0007657739,0.00035322396,0.0073636486,0.0024225086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003318754,0.0022449465,0.0020180908,0.0026563786,0.0019243336,0.0061270683,0.0019558317,0.007052894,0.015342309],"category_scores_gemma":[0.014691128,0.0005404171,0.0013062803,0.0010860928,0.0013306153,0.003523561,0.0010653833,0.011825116,0.013064789],"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.000028998436,0.000010665436,0.00002808267,0.00019360916,0.000005976489,0.00013155199,0.0000137868,0.000030523915,0.000111807516,0.00046148716,0.99226177,0.006721698],"study_design_scores_gemma":[0.000019570887,0.000031270698,0.00019505867,0.00027653849,0.000015861522,0.000388708,0.000043682692,0.00015521074,0.00018477738,0.0008141568,0.99786276,0.000012402817],"about_ca_topic_score_codex":0.000568639,"about_ca_topic_score_gemma":0.0011789269,"teacher_disagreement_score":0.015342309,"about_ca_system_score_codex":0.0016504626,"about_ca_system_score_gemma":0.0018690518,"threshold_uncertainty_score":0.051325083},"labels":[],"label_agreement":null},{"id":"W4232955590","doi":"10.1109/jsac.2012.120901","title":"Guest Editorial Theories and Methods for Advanced Wireless Relays — Issue I","year":2012,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"Queen's University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Computer network","score_opus":0.028693618622169254,"score_gpt":0.38480298849992683,"score_spread":0.3561093698777576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232955590","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006238994,0.0054813656,0.0006683684,0.023037655,0.9674634,0.000013657561,0.000030130353,0.000043594675,0.0031994868],"genre_scores_gemma":[0.001032408,0.0053467206,0.00029459916,0.007507129,0.96890277,0.000018889017,0.000025222744,0.000052547963,0.016819678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772507,0.0003064061,0.00019965795,0.00027648263,0.0013329285,0.00015939797],"domain_scores_gemma":[0.98939145,0.0036581862,0.000504184,0.00028012827,0.005133729,0.0010322356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034952578,0.0018928554,0.0013863794,0.0026005718,0.0013962155,0.0046275826,0.0014051206,0.0044210535,0.011322291],"category_scores_gemma":[0.012836794,0.00050317775,0.0012353814,0.00084865274,0.0015412604,0.0027994623,0.0009281368,0.010401588,0.007797566],"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.00003881902,0.000011086466,0.000019180612,0.00017315807,0.000010064285,0.00007649537,0.000013781522,0.000056790617,0.00013765189,0.0023045696,0.9876872,0.009471303],"study_design_scores_gemma":[0.000029122899,0.000029686027,0.00012316667,0.00023455075,0.000021451382,0.00018850638,0.00002174421,0.00029760422,0.00023580047,0.002667563,0.99613863,0.00001210176],"about_ca_topic_score_codex":0.00035843748,"about_ca_topic_score_gemma":0.00067821017,"teacher_disagreement_score":0.011322291,"about_ca_system_score_codex":0.0014459478,"about_ca_system_score_gemma":0.0012901238,"threshold_uncertainty_score":0.037876844},"labels":[],"label_agreement":null},{"id":"W4234771995","doi":"10.1109/jsac.2014.2349631","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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; Computer network","score_opus":0.06243337712605035,"score_gpt":0.2558702963348722,"score_spread":0.19343691920882183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234771995","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.002039923,0.006262354,0.0376979,0.008669128,0.009981497,0.00031629056,0.008911445,0.005105538,0.92101586],"genre_scores_gemma":[0.0109250825,0.006571361,0.0038655691,0.0013712549,0.0018029507,0.00020355466,0.0095536625,0.00068865996,0.965018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993337,0.00009525018,0.0000390266,0.000120702985,0.00033632014,0.0000749369],"domain_scores_gemma":[0.9974044,0.00041064352,0.00012991605,0.000690003,0.001154686,0.00021039566],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007829461,0.0016570032,0.0013241658,0.0030662257,0.0011025555,0.003489098,0.0008704052,0.0022858558,0.35143438],"category_scores_gemma":[0.003939662,0.0006304552,0.0003740762,0.0034720893,0.00056212075,0.0027315046,0.0016680101,0.0025587473,0.368841],"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.000042183503,0.00004240514,0.00014986304,0.00012170134,0.00001137953,0.00006071766,0.000018422246,0.0009708245,0.00092199305,0.00814477,0.7799598,0.20955598],"study_design_scores_gemma":[0.000015124196,0.000030734747,0.00044202522,0.000115403505,0.000018884864,0.00009168439,0.000022847378,0.0033489985,0.00086409657,0.0065145367,0.9885174,0.00001825529],"about_ca_topic_score_codex":0.0041089715,"about_ca_topic_score_gemma":0.0035192273,"teacher_disagreement_score":0.64856565,"about_ca_system_score_codex":0.001040316,"about_ca_system_score_gemma":0.0022910405,"threshold_uncertainty_score":0.92510015},"labels":[],"label_agreement":null},{"id":"W4236165651","doi":"10.1109/jsac.2014.02.cover3","title":"Staff List","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"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; Computer network","score_opus":0.04088030239093019,"score_gpt":0.3229360583233427,"score_spread":0.2820557559324125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236165651","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.0004453965,0.002848498,0.0060407314,0.010882332,0.030547692,0.0007917514,0.017438972,0.006896515,0.9241082],"genre_scores_gemma":[0.0008907567,0.0015245294,0.0013291643,0.0021192948,0.0024844683,0.00031431954,0.007471435,0.0011694012,0.98269665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978649,0.00026221972,0.00014873118,0.0002638344,0.0011905151,0.00026992217],"domain_scores_gemma":[0.97625136,0.0026857716,0.00069956883,0.0021092757,0.01283826,0.005415782],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002803384,0.0011720635,0.0021653138,0.0063037043,0.002592482,0.006876085,0.0027768684,0.0026561085,0.91748667],"category_scores_gemma":[0.02554816,0.0006071488,0.00091947045,0.004359949,0.00061286875,0.0036069246,0.0033821838,0.0023072273,0.93088377],"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.00001564475,0.000020570362,0.00005401638,0.0001172363,0.000001556251,0.000013252794,0.000007867222,0.000039100745,0.000099360805,0.00089210074,0.95718724,0.041552052],"study_design_scores_gemma":[0.000012322188,0.000019382434,0.00014811671,0.00017232793,0.0000039241013,0.000031920325,0.00003130956,0.000111653375,0.00014927925,0.0012509177,0.9980609,0.000007938537],"about_ca_topic_score_codex":0.0022439673,"about_ca_topic_score_gemma":0.003894906,"teacher_disagreement_score":0.08251333,"about_ca_system_score_codex":0.0014036802,"about_ca_system_score_gemma":0.005652828,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4238976183","doi":"10.1109/jsac.2015.2476635","title":"IEEE Communications Society Information","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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.12742892880088053,"score_gpt":0.2789224988363914,"score_spread":0.1514935700355109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238976183","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.0020037494,0.0062274765,0.038293302,0.00871138,0.009935514,0.0003219939,0.0093615,0.005197315,0.91994774],"genre_scores_gemma":[0.010952762,0.006662324,0.0039687175,0.001378604,0.0018086843,0.00020808389,0.0100000175,0.00069938815,0.9643213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933225,0.000094719224,0.000039785573,0.00012011763,0.00033827833,0.00007479727],"domain_scores_gemma":[0.9973605,0.00041695387,0.00013278412,0.0007074249,0.0011698244,0.00021242269],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079088804,0.0016478013,0.001326115,0.0030942396,0.0010946243,0.003508166,0.0008727488,0.002277907,0.35139355],"category_scores_gemma":[0.0040400648,0.00063349935,0.00037179742,0.003483083,0.00056175684,0.0027685093,0.0016729477,0.0025575138,0.36881554],"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.000041246203,0.00004141909,0.00014635579,0.00012129074,0.0000111468935,0.000059426944,0.000018267929,0.00096009247,0.0008848997,0.008236594,0.7838615,0.20561776],"study_design_scores_gemma":[0.000014921427,0.00002964329,0.00043190684,0.00011581173,0.000018390287,0.00008992217,0.00002265913,0.0033434096,0.00085211423,0.0065960702,0.9884671,0.00001819747],"about_ca_topic_score_codex":0.00412686,"about_ca_topic_score_gemma":0.0035328032,"teacher_disagreement_score":0.35139355,"about_ca_system_score_codex":0.0010464934,"about_ca_system_score_gemma":0.0023189378,"threshold_uncertainty_score":0.9251584},"labels":[],"label_agreement":null},{"id":"W4242396854","doi":"10.1109/jsac.2019.2908568","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement 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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242396854","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4244481796","doi":"10.1109/jsac.2014.2387454","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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; Computer network","score_opus":0.06243337712605035,"score_gpt":0.2558702963348722,"score_spread":0.19343691920882183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244481796","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.002039923,0.006262354,0.0376979,0.008669128,0.009981497,0.00031629056,0.008911445,0.005105538,0.92101586],"genre_scores_gemma":[0.0109250825,0.006571361,0.0038655691,0.0013712549,0.0018029507,0.00020355466,0.0095536625,0.00068865996,0.965018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993337,0.00009525018,0.0000390266,0.000120702985,0.00033632014,0.0000749369],"domain_scores_gemma":[0.9974044,0.00041064352,0.00012991605,0.000690003,0.001154686,0.00021039566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829461,0.0016570032,0.0013241658,0.0030662257,0.0011025555,0.003489098,0.0008704052,0.0022858558,0.35143438],"category_scores_gemma":[0.003939662,0.0006304552,0.0003740762,0.0034720893,0.00056212075,0.0027315046,0.0016680101,0.0025587473,0.368841],"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.000042183503,0.00004240514,0.00014986304,0.00012170134,0.00001137953,0.00006071766,0.000018422246,0.0009708245,0.00092199305,0.00814477,0.7799598,0.20955598],"study_design_scores_gemma":[0.000015124196,0.000030734747,0.00044202522,0.000115403505,0.000018884864,0.00009168439,0.000022847378,0.0033489985,0.00086409657,0.0065145367,0.9885174,0.00001825529],"about_ca_topic_score_codex":0.0041089715,"about_ca_topic_score_gemma":0.0035192273,"teacher_disagreement_score":0.35143438,"about_ca_system_score_codex":0.001040316,"about_ca_system_score_gemma":0.0022910405,"threshold_uncertainty_score":0.92510015},"labels":[],"label_agreement":null},{"id":"W4246737341","doi":"10.1109/jsac.2014.2339474","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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.06243337712605035,"score_gpt":0.2558702963348722,"score_spread":0.19343691920882183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246737341","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.002039923,0.006262354,0.0376979,0.008669128,0.009981497,0.00031629056,0.008911445,0.005105538,0.92101586],"genre_scores_gemma":[0.0109250825,0.006571361,0.0038655691,0.0013712549,0.0018029507,0.00020355466,0.0095536625,0.00068865996,0.965018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993337,0.00009525018,0.0000390266,0.000120702985,0.00033632014,0.0000749369],"domain_scores_gemma":[0.9974044,0.00041064352,0.00012991605,0.000690003,0.001154686,0.00021039566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829461,0.0016570032,0.0013241658,0.0030662257,0.0011025555,0.003489098,0.0008704052,0.0022858558,0.35143438],"category_scores_gemma":[0.003939662,0.0006304552,0.0003740762,0.0034720893,0.00056212075,0.0027315046,0.0016680101,0.0025587473,0.368841],"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.000042183503,0.00004240514,0.00014986304,0.00012170134,0.00001137953,0.00006071766,0.000018422246,0.0009708245,0.00092199305,0.00814477,0.7799598,0.20955598],"study_design_scores_gemma":[0.000015124196,0.000030734747,0.00044202522,0.000115403505,0.000018884864,0.00009168439,0.000022847378,0.0033489985,0.00086409657,0.0065145367,0.9885174,0.00001825529],"about_ca_topic_score_codex":0.0041089715,"about_ca_topic_score_gemma":0.0035192273,"teacher_disagreement_score":0.35143438,"about_ca_system_score_codex":0.001040316,"about_ca_system_score_gemma":0.0022910405,"threshold_uncertainty_score":0.92510015},"labels":[],"label_agreement":null},{"id":"W4247511623","doi":"10.1109/jsac.2019.2929719","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement Systems","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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247511623","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4248240057","doi":"10.1109/jsac.2019.2932532","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement Systems","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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248240057","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4249590697","doi":"10.1109/jsac.2015.2425095","title":"IEEE Communications Society Information","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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; Computer network","score_opus":0.12742892880088053,"score_gpt":0.2789224988363914,"score_spread":0.1514935700355109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249590697","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.0020037494,0.0062274765,0.038293302,0.00871138,0.009935514,0.0003219939,0.0093615,0.005197315,0.91994774],"genre_scores_gemma":[0.010952762,0.006662324,0.0039687175,0.001378604,0.0018086843,0.00020808389,0.0100000175,0.00069938815,0.9643213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933225,0.000094719224,0.000039785573,0.00012011763,0.00033827833,0.00007479727],"domain_scores_gemma":[0.9973605,0.00041695387,0.00013278412,0.0007074249,0.0011698244,0.00021242269],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079088804,0.0016478013,0.001326115,0.0030942396,0.0010946243,0.003508166,0.0008727488,0.002277907,0.35139355],"category_scores_gemma":[0.0040400648,0.00063349935,0.00037179742,0.003483083,0.00056175684,0.0027685093,0.0016729477,0.0025575138,0.36881554],"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.000041246203,0.00004141909,0.00014635579,0.00012129074,0.0000111468935,0.000059426944,0.000018267929,0.00096009247,0.0008848997,0.008236594,0.7838615,0.20561776],"study_design_scores_gemma":[0.000014921427,0.00002964329,0.00043190684,0.00011581173,0.000018390287,0.00008992217,0.00002265913,0.0033434096,0.00085211423,0.0065960702,0.9884671,0.00001819747],"about_ca_topic_score_codex":0.00412686,"about_ca_topic_score_gemma":0.0035328032,"teacher_disagreement_score":0.6486064,"about_ca_system_score_codex":0.0010464934,"about_ca_system_score_gemma":0.0023189378,"threshold_uncertainty_score":0.9251584},"labels":[],"label_agreement":null},{"id":"W4249611202","doi":"10.1109/jsac.2019.2914599","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement 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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249611202","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4252030493","doi":"10.1109/jsac.2019.2944795","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement 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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252030493","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4255994121","doi":"10.1109/jsac.2019.2954226","title":"IEEE Journal on Selected Areas in Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sensor Technology and Measurement Systems","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":"Canadian Standards Association; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05444221411786272,"score_gpt":0.3015235109881042,"score_spread":0.2470812968702415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255994121","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.003090384,0.18289647,0.051918432,0.014118415,0.051402587,0.0004813626,0.001922832,0.0012434885,0.692926],"genre_scores_gemma":[0.044670805,0.23906049,0.020803964,0.004656013,0.039278913,0.00073658355,0.0047271615,0.000500193,0.6455659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980063,0.00038993632,0.00013541839,0.00031711606,0.0010184571,0.00013280471],"domain_scores_gemma":[0.9965702,0.0008415347,0.00024286001,0.000458361,0.0015638131,0.0003232979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012452268,0.0013666599,0.0015747418,0.0021557289,0.0010899148,0.0038164677,0.0011144504,0.0019818207,0.09379353],"category_scores_gemma":[0.004075178,0.0002824773,0.0005480855,0.003969211,0.0012608159,0.0024356665,0.0012597506,0.0031530245,0.055062696],"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.00008328166,0.000071333765,0.000815359,0.00088512927,0.00006103729,0.00021153179,0.00011475915,0.0012453627,0.0013398565,0.044555128,0.6266546,0.3239626],"study_design_scores_gemma":[0.00000889544,0.00005153314,0.0007439029,0.00032573522,0.000018481507,0.00026011045,0.000072353396,0.0012041503,0.00017527225,0.012746733,0.98437715,0.000015705527],"about_ca_topic_score_codex":0.0021764692,"about_ca_topic_score_gemma":0.001504344,"teacher_disagreement_score":0.9062065,"about_ca_system_score_codex":0.0012236038,"about_ca_system_score_gemma":0.0024304606,"threshold_uncertainty_score":0.3137706},"labels":[],"label_agreement":null},{"id":"W4280644846","doi":"10.1109/jsac.2022.3192053","title":"Hybrid Reinforcement Learning for STAR-RISs: A Coupled Phase-Shift Model Based Beamformer","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":76,"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":"European Research Council; Engineering and Physical Sciences Research Council; China Scholarship Council","keywords":"Reinforcement learning; Computer science; Hybrid algorithm (constraint satisfaction); Markov decision process; Mathematical optimization; Algorithm; Transmission (telecommunications); Hybrid system; Markov process; Artificial intelligence; Constraint satisfaction; Mathematics; Telecommunications; Local consistency","score_opus":0.03506494440618202,"score_gpt":0.3007106753041846,"score_spread":0.2656457308980026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280644846","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.008382734,0.00014430602,0.9890099,0.000108894455,0.000030908177,0.00001672381,0.000015299913,0.00025752184,0.0020336744],"genre_scores_gemma":[0.82266074,0.00025942226,0.17099717,0.00031722878,0.000042055155,0.00012516543,0.00009657969,0.000059749513,0.0054418044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970573,0.00008248786,0.000013353695,0.00007581389,0.000079452126,0.000043094253],"domain_scores_gemma":[0.9995732,0.00019983157,0.000061516635,0.000035720223,0.000099509314,0.000030281552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055957516,0.00065500557,0.00065991236,0.00017958619,0.0001994992,0.0005026804,0.0009451327,0.0006804882,0.0016150645],"category_scores_gemma":[0.0010219067,0.00032681943,0.00043663147,0.0003003104,0.00060232054,0.000577106,0.0007331361,0.001104375,0.00047711108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000829312,0.000041321455,0.0005406597,0.000053051874,0.000037641737,0.00007276103,0.000052500855,0.92968065,0.0053427955,0.0062184916,0.0009398422,0.056937374],"study_design_scores_gemma":[0.000006035279,0.000019316483,0.000030804047,0.0000017253758,0.0000036090403,0.000009404098,0.0000026413622,0.9984921,0.00042341574,0.00079035514,0.00021839164,0.0000022410302],"about_ca_topic_score_codex":0.0034251658,"about_ca_topic_score_gemma":0.003540018,"teacher_disagreement_score":0.0034251658,"about_ca_system_score_codex":0.00043734547,"about_ca_system_score_gemma":0.0008058397,"threshold_uncertainty_score":0.0068104267},"labels":[],"label_agreement":null},{"id":"W4281638644","doi":"10.1109/jsac.2022.3180799","title":"Interference Management for Over-the-Air Federated Learning in Multi-Cell Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":99,"is_retracted":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":"Telecommunications link; Computer science; Interference (communication); Convergence (economics); Wireless; Transmission (telecommunications); Wireless network; Computer network; Optimization problem; Distributed computing; Channel (broadcasting); Algorithm; Telecommunications","score_opus":0.05358198947933894,"score_gpt":0.30888802746992366,"score_spread":0.2553060379905847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281638644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07550368,0.0003368631,0.9217406,0.00021209037,0.000040493058,0.00003876054,0.00002854253,0.00034343227,0.0017555943],"genre_scores_gemma":[0.9574668,0.00008400329,0.04140477,0.00014211703,0.000020555659,0.000046271365,0.000037053826,0.000022787373,0.000775643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00026595188,0.000036615234,0.000166217,0.00016113762,0.00017868998],"domain_scores_gemma":[0.9980578,0.0010290748,0.00021702916,0.00021058993,0.00035422755,0.00013137424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001999713,0.0006989664,0.0010033771,0.00035400395,0.0006309421,0.0009976812,0.0015248285,0.00095825025,0.0009228112],"category_scores_gemma":[0.004405115,0.00023745092,0.00037210502,0.000499686,0.0009150403,0.0014958911,0.0019266631,0.0010922004,0.00015973652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014094436,0.000108275104,0.0009826295,0.000035218014,0.000028526512,0.000076954624,0.000067195055,0.9467352,0.0013189194,0.003878838,0.00059775263,0.046029583],"study_design_scores_gemma":[0.000005484459,0.00002805405,0.000061356666,0.0000024121207,0.0000031249656,0.000012992855,0.00001201638,0.9978015,0.00035550058,0.0016285785,0.00008672273,0.0000022468198],"about_ca_topic_score_codex":0.0028367038,"about_ca_topic_score_gemma":0.00285697,"teacher_disagreement_score":0.0028367038,"about_ca_system_score_codex":0.0008451174,"about_ca_system_score_gemma":0.0011174643,"threshold_uncertainty_score":0.0105755925},"labels":[],"label_agreement":null},{"id":"W4290717193","doi":"10.1109/jsac.2022.3196099","title":"A Joint Hybrid Precoding/Combining Scheme Based on Equivalent Channel for Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","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":"National Key Research and Development Program of China; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Precoding; Computer science; MIMO; Beamforming; Singular value decomposition; Spectral efficiency; Zero-forcing precoding; Channel (broadcasting); Electronic engineering; Multi-user MIMO; Channel state information; Algorithm; Computer engineering; Topology (electrical circuits); Telecommunications; Wireless; Engineering; Electrical engineering","score_opus":0.08272226470049036,"score_gpt":0.2817083007827369,"score_spread":0.19898603608224652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290717193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011455957,0.00024019493,0.984091,0.00006493287,0.00004520154,0.000027689737,0.000033936565,0.00020920327,0.003831942],"genre_scores_gemma":[0.62784916,0.00059339986,0.36693335,0.0002046312,0.00011701586,0.00009842866,0.0001080648,0.000024649818,0.004071288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.00011518034,0.000024718996,0.000080606,0.00017059474,0.000054795382],"domain_scores_gemma":[0.9997942,0.000053680724,0.000030323508,0.000048222682,0.000057711033,0.000015913245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027611895,0.0007068197,0.00050573563,0.00034493522,0.00037822482,0.00063821167,0.000517673,0.0005203441,0.0015403559],"category_scores_gemma":[0.00046373162,0.00022782444,0.0004916483,0.0006487456,0.00040812325,0.0007247933,0.00064955396,0.00046813505,0.0004734877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026435615,0.00013046365,0.0009802721,0.00029296402,0.00018270603,0.0004991201,0.00024938467,0.35694143,0.19923656,0.10521351,0.0035554473,0.33245376],"study_design_scores_gemma":[0.000028608823,0.00033265035,0.0002842532,0.000019019602,0.000053375883,0.0004991326,0.00003332843,0.9567476,0.025966262,0.0099732075,0.0060041547,0.000058387657],"about_ca_topic_score_codex":0.00059715373,"about_ca_topic_score_gemma":0.0011383373,"teacher_disagreement_score":0.0015403559,"about_ca_system_score_codex":0.00020432682,"about_ca_system_score_gemma":0.00040729617,"threshold_uncertainty_score":0.0051530004},"labels":[],"label_agreement":null},{"id":"W4296132227","doi":"10.1109/jsac.2022.3196091","title":"Blockchain-Based Credential Management for Anonymous Authentication in SAGVN","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Blockchain Technology Applications and Security","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; University of Calgary; University of Waterloo","funders":"","keywords":"Credential; Computer science; Authentication (law); Computer security","score_opus":0.02172383129786306,"score_gpt":0.28195580971177886,"score_spread":0.2602319784139158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296132227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028636051,0.00020058047,0.9642884,0.00040217413,0.00008527898,0.0002889731,0.00010343941,0.00068614975,0.005309018],"genre_scores_gemma":[0.8718744,0.00026048228,0.12114222,0.00015114801,0.000051183768,0.00028432917,0.00028931367,0.00005594872,0.0058910334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383473,0.002101873,0.00041806258,0.0007989536,0.002125011,0.0007214014],"domain_scores_gemma":[0.9950153,0.0013397573,0.00052204373,0.0019197727,0.00075595867,0.0004472157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004067477,0.00042456778,0.00087456894,0.0008003425,0.0016956449,0.0021164475,0.0025013755,0.0015498844,0.0030731747],"category_scores_gemma":[0.006257149,0.00037049412,0.00067816756,0.001235492,0.0018459002,0.0056571797,0.00557636,0.0016143711,0.0010522723],"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.0007560493,0.00028850103,0.0016356547,0.00024606628,0.00008435457,0.0007230921,0.001012827,0.22960551,0.018835155,0.62013435,0.003891456,0.122787006],"study_design_scores_gemma":[0.00008516621,0.000112882975,0.0002050036,0.000040757877,0.000023396622,0.0002135892,0.000092562346,0.82627773,0.009364622,0.14898917,0.014544364,0.00005073155],"about_ca_topic_score_codex":0.002573716,"about_ca_topic_score_gemma":0.0020046388,"teacher_disagreement_score":0.004067477,"about_ca_system_score_codex":0.0021174608,"about_ca_system_score_gemma":0.0033301946,"threshold_uncertainty_score":0.021511137},"labels":[],"label_agreement":null},{"id":"W4296132259","doi":"10.1109/jsac.2022.3195678","title":"Guest Editorial Special Issue on Antenna Array Enabled Space/Air/Ground Communications and Networking","year":2022,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite Communication 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":"Huawei Technologies (Canada); Memorial University of Newfoundland","funders":"","keywords":"Computer science; Telecommunications; Beamforming; Wireless; Computer network","score_opus":0.02488701410746892,"score_gpt":0.281305229812231,"score_spread":0.2564182157047621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296132259","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019528084,0.0054114684,0.00032768262,0.01080309,0.9755263,0.000048652702,0.000146087,0.00015297116,0.0073884465],"genre_scores_gemma":[0.0011532181,0.0077834358,0.00020097276,0.005669224,0.95835745,0.000043182707,0.0001714906,0.000089175934,0.026531884],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976622,0.00020216254,0.00019360795,0.0005189709,0.001071594,0.0003515171],"domain_scores_gemma":[0.9934441,0.0010988113,0.00048763273,0.00022549466,0.0028710784,0.0018728668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363079,0.002678391,0.002447904,0.0021146366,0.0020075506,0.008323186,0.0027953854,0.006729823,0.073275544],"category_scores_gemma":[0.00607316,0.0008406938,0.0017405289,0.00095984794,0.0011792802,0.004187842,0.0016520527,0.008183977,0.0355865],"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.00011228274,0.00004352265,0.00011401211,0.00042240383,0.000021296315,0.00021225888,0.000019639734,0.00008814653,0.00058443885,0.0009372082,0.982371,0.01507384],"study_design_scores_gemma":[0.000047013917,0.00007198945,0.00030980608,0.00017170903,0.000028747365,0.00028459702,0.00003920731,0.0002298889,0.00040799915,0.00082776387,0.9975636,0.000017632135],"about_ca_topic_score_codex":0.00045975644,"about_ca_topic_score_gemma":0.0009174503,"teacher_disagreement_score":0.073275544,"about_ca_system_score_codex":0.0015823797,"about_ca_system_score_gemma":0.0014846921,"threshold_uncertainty_score":0.24513108},"labels":[],"label_agreement":null},{"id":"W4310049404","doi":"10.1109/jsac.2022.3213312","title":"Blockchain-Based Data Sharing With Key Update for Future Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Blockchain; Encryption; Key (lock); Key management; Provisioning; Smart contract; Computer security; Data sharing; Computer network; Distributed computing","score_opus":0.03574622059808942,"score_gpt":0.28655734212445555,"score_spread":0.25081112152636614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310049404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073126994,0.00045479814,0.9176691,0.0007668493,0.000119210425,0.0002845243,0.00017589451,0.0008068416,0.006595755],"genre_scores_gemma":[0.9349671,0.00025372682,0.059401926,0.00010586483,0.000050337632,0.00015705307,0.00019784758,0.0000313388,0.0048347847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975216,0.00057959807,0.0002187955,0.0004405367,0.0009162229,0.0003232857],"domain_scores_gemma":[0.99650145,0.0008112554,0.00046423642,0.0013814016,0.00059051474,0.0002511323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002083404,0.00035792566,0.000689467,0.00056052004,0.0014451039,0.00129463,0.0016061761,0.0010117028,0.0028186215],"category_scores_gemma":[0.0036902996,0.00023658632,0.00044009436,0.00090905034,0.0012125566,0.0045324727,0.0023942455,0.0009760867,0.0006139097],"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.0010387176,0.00033635582,0.003433168,0.00031843537,0.000121969555,0.0009229998,0.0010961051,0.302503,0.05277367,0.40676326,0.008170694,0.22252166],"study_design_scores_gemma":[0.00009046498,0.0001568904,0.00035542887,0.000022356913,0.000032811055,0.00030168224,0.000082975595,0.8673705,0.015296577,0.102962956,0.01327852,0.00004882165],"about_ca_topic_score_codex":0.0023065074,"about_ca_topic_score_gemma":0.0019610801,"teacher_disagreement_score":0.0028186215,"about_ca_system_score_codex":0.001309219,"about_ca_system_score_gemma":0.0025741544,"threshold_uncertainty_score":0.011018217},"labels":[],"label_agreement":null},{"id":"W4310055708","doi":"10.1109/jsac.2022.3213341","title":"FRUIT: A Blockchain-Based Efficient and Privacy-Preserving Quality-Aware Incentive Scheme","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Queen's University","funders":"National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Incentive; Smart contract; Encryption; Blockchain; Security analysis; Computer security; Hash function","score_opus":0.032199773250941054,"score_gpt":0.3052527836032776,"score_spread":0.2730530103523366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310055708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024353482,0.00064289384,0.9649012,0.0009294552,0.00016587447,0.0005439712,0.00072935096,0.0014045702,0.0063291527],"genre_scores_gemma":[0.80310094,0.00073461427,0.18281603,0.00040078946,0.00012632115,0.0007182926,0.0010660848,0.00013123552,0.0109057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964302,0.00090509636,0.0002755023,0.00061479467,0.0012679258,0.00050657254],"domain_scores_gemma":[0.99534386,0.0014243859,0.00061519205,0.001399853,0.0007503907,0.00046633848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030918384,0.0007193808,0.0014822693,0.00090458035,0.0015084271,0.0017369252,0.0030539567,0.0017748644,0.00464803],"category_scores_gemma":[0.008292246,0.00045959145,0.0008280334,0.0019417366,0.0013011433,0.005432513,0.004823675,0.0018885417,0.0011784947],"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.0015154614,0.00040376384,0.0028609482,0.0006470607,0.00019167343,0.00092664367,0.0008398957,0.28636438,0.022928754,0.3469631,0.020584464,0.31577387],"study_design_scores_gemma":[0.00027038492,0.00023034138,0.00043213196,0.000052573003,0.000050546907,0.00043985812,0.00008178824,0.8135247,0.0064950543,0.15760826,0.020716852,0.000097539094],"about_ca_topic_score_codex":0.0024158212,"about_ca_topic_score_gemma":0.0021271978,"teacher_disagreement_score":0.00464803,"about_ca_system_score_codex":0.0017283881,"about_ca_system_score_gemma":0.004319759,"threshold_uncertainty_score":0.016351402},"labels":[],"label_agreement":null},{"id":"W4312050893","doi":"10.1109/jsac.2022.3221991","title":"Deep Learning-Enabled Semantic Communication Systems With Task-Unaware Transmitter and Dynamic Data","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":232,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Transmitter; Task (project management); Artificial intelligence; Data transmission; Machine learning; Computer network; Channel (broadcasting)","score_opus":0.02747285909964657,"score_gpt":0.27351984668863916,"score_spread":0.24604698758899257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02814564,0.00023801901,0.9687682,0.00021070952,0.000056938658,0.000031843218,0.000075599695,0.0010805491,0.001392517],"genre_scores_gemma":[0.81600237,0.00026530382,0.1786405,0.00032191898,0.00008120035,0.00012422132,0.00035347187,0.00010681701,0.0041041463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.00012052006,0.00003842066,0.00016500121,0.00013976893,0.00007715505],"domain_scores_gemma":[0.9989667,0.00041277678,0.00011599603,0.0002246976,0.00022531344,0.00005458735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012036929,0.0007254771,0.0007323491,0.00043122517,0.00047724773,0.00085648726,0.0017305962,0.0010337776,0.0013338703],"category_scores_gemma":[0.0033811838,0.000321159,0.00041416707,0.0006511736,0.0009379074,0.0031252643,0.0021770743,0.0018585224,0.000450874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067202584,0.000364022,0.0017186436,0.00021830668,0.0001299645,0.00033067417,0.00045004208,0.5389986,0.024052413,0.041885074,0.0052963295,0.38588384],"study_design_scores_gemma":[0.000010078911,0.00003785853,0.0001172007,0.000006372362,0.000009856247,0.000029036251,0.00001986605,0.98341334,0.0047931,0.010913009,0.0006406152,0.000009636985],"about_ca_topic_score_codex":0.003828184,"about_ca_topic_score_gemma":0.0033851662,"teacher_disagreement_score":0.003828184,"about_ca_system_score_codex":0.00091205264,"about_ca_system_score_gemma":0.0012750274,"threshold_uncertainty_score":0.007611811},"labels":[],"label_agreement":null},{"id":"W4312918528","doi":"10.1109/jsac.2022.3227088","title":"Joint Communication and Computation Offloading for Ultra-Reliable and Low-Latency With Multi-Tier Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":40,"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; Fonds National de la Recherche Luxembourg; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Computer science; Computation offloading; Lyapunov optimization; Optimization problem; Distributed computing; Mathematical optimization; Cloud computing; Latency (audio); Edge computing; Algorithm","score_opus":0.04341358534170696,"score_gpt":0.29218128106055286,"score_spread":0.24876769571884588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312918528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044996772,0.0009006536,0.95003474,0.00025525232,0.00007994731,0.00007248612,0.000057583613,0.0001885519,0.0034141496],"genre_scores_gemma":[0.92440504,0.0004436223,0.07307585,0.0001338354,0.00007099693,0.00006683138,0.00005651323,0.000057315003,0.0016900254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911314,0.00024239496,0.000031936856,0.00017476514,0.00018517484,0.00025259375],"domain_scores_gemma":[0.99902964,0.00055125385,0.00011219607,0.0001133359,0.00010774079,0.00008579046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481535,0.0012270965,0.0010706685,0.00026719453,0.00065396796,0.0012428535,0.0012530312,0.00074190204,0.0015071823],"category_scores_gemma":[0.0017023741,0.00036063627,0.00050395966,0.00082067196,0.0007682384,0.0014458321,0.0012620768,0.0009035789,0.00020647976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012373258,0.000084109386,0.0008043843,0.00014033099,0.000043597232,0.00019267727,0.000069983216,0.9488917,0.0045942147,0.014752996,0.0012030312,0.029099243],"study_design_scores_gemma":[0.0000037128339,0.000022864957,0.000110516106,0.0000031980358,0.0000065807003,0.000023330274,0.000017736333,0.9958473,0.00048321357,0.0031981594,0.00027892116,0.000004466828],"about_ca_topic_score_codex":0.004901185,"about_ca_topic_score_gemma":0.0060717813,"teacher_disagreement_score":0.004901185,"about_ca_system_score_codex":0.00089985953,"about_ca_system_score_gemma":0.0013362812,"threshold_uncertainty_score":0.0097453},"labels":[],"label_agreement":null},{"id":"W4315783855","doi":"10.1109/jsac.2023.3235443","title":"Federated Deep Reinforcement Learning for Recommendation-Enabled Edge Caching in Mobile Edge-Cloud Computing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","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","funders":"National Key Research and Development Program of China; Chongqing Research Program of Basic Research and Frontier Technology; Fundamental Research Funds for the Key Research Program of Chongqing Science and Technology Commission; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Server; Cloud computing; Edge computing; Enhanced Data Rates for GSM Evolution; Distributed computing; Markov decision process; Mobile edge computing; Edge device; Reinforcement learning; Computer network; Base station; Recommender system; Markov process; Artificial intelligence; Machine learning; Operating system","score_opus":0.03701572615767868,"score_gpt":0.2985865757943792,"score_spread":0.2615708496367005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13759774,0.0009185218,0.856549,0.00057590025,0.000096401774,0.000060496877,0.00010386188,0.0008536706,0.0032442885],"genre_scores_gemma":[0.9775088,0.0001099316,0.020797411,0.000108742184,0.000018799601,0.000030540472,0.000060640963,0.000020017264,0.0013452413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00012789354,0.00001981726,0.00010797885,0.00007276363,0.00012027407],"domain_scores_gemma":[0.99849045,0.0009150284,0.00014686813,0.000093692724,0.00025620236,0.00009779719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010307182,0.0006003764,0.0012884832,0.0002711262,0.00040149156,0.0006967102,0.00143161,0.0009713938,0.0011411313],"category_scores_gemma":[0.002981023,0.00039154408,0.00039080816,0.000409877,0.00058953685,0.00076363713,0.00070035824,0.0011787652,0.00018217422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007987876,0.00005961644,0.0007820416,0.00002798892,0.00002712104,0.000046766578,0.000019699222,0.9808462,0.0005521386,0.0018216578,0.000533486,0.015203416],"study_design_scores_gemma":[0.000003169719,0.0000071209806,0.00004070398,9.217154e-7,0.000002471237,0.0000023544146,0.0000017137048,0.999461,0.00006988049,0.00038051326,0.000029035473,0.0000010622912],"about_ca_topic_score_codex":0.025704522,"about_ca_topic_score_gemma":0.027901376,"teacher_disagreement_score":0.025704522,"about_ca_system_score_codex":0.0013330018,"about_ca_system_score_gemma":0.0014724777,"threshold_uncertainty_score":0.05110985},"labels":[],"label_agreement":null},{"id":"W4315783857","doi":"10.1109/jsac.2023.3236003","title":"Federated Learning Over Fully-Decoupled RAN Architecture for Two-Tier Computing Acceleration","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Computer network; Cloud computing; Power control; Radio access network; Base station; Wireless; Distributed computing; Wireless network; Power (physics); Telecommunications","score_opus":0.0624619047864794,"score_gpt":0.3465104434729623,"score_spread":0.2840485386864829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033302113,0.0003013268,0.96057606,0.00017054833,0.00006443505,0.00004958064,0.00003984437,0.0013014656,0.004194691],"genre_scores_gemma":[0.8474295,0.00021263816,0.14913607,0.00013906888,0.000033327455,0.00008602656,0.00012152162,0.000058394522,0.0027834845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995247,0.00010947791,0.000022368353,0.00011267693,0.00011299405,0.00011775076],"domain_scores_gemma":[0.99959666,0.000109927416,0.000034335288,0.00009121571,0.00012074408,0.000047220743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009953,0.00073539064,0.00061700563,0.00024125373,0.0004488563,0.0009164857,0.0012402702,0.000493386,0.0026760434],"category_scores_gemma":[0.001075028,0.00022535812,0.00047196503,0.0003641217,0.00040614753,0.0010009158,0.0010813031,0.00093937264,0.0005596021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028943917,0.000201234,0.0010697016,0.00010156812,0.000060032442,0.00023795383,0.00008991539,0.85103416,0.015404041,0.01394281,0.0025815002,0.11498762],"study_design_scores_gemma":[0.0000053794197,0.000027968721,0.000057769503,0.0000021533601,0.000003925816,0.000017293618,0.0000073359083,0.99694425,0.0010251321,0.0015389452,0.00036621036,0.0000036885751],"about_ca_topic_score_codex":0.0032862332,"about_ca_topic_score_gemma":0.005188332,"teacher_disagreement_score":0.0032862332,"about_ca_system_score_codex":0.0005108731,"about_ca_system_score_gemma":0.0011735864,"threshold_uncertainty_score":0.00895226},"labels":[],"label_agreement":null},{"id":"W4317385005","doi":"10.1109/jsac.2022.3228093","title":"Guest Editorial Multi-Tier Computing for Next Generation Wireless Networks—Part I","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Edge computing; Utility computing; Server; Computer network; Edge device; Mobile edge computing; Wireless network; Wireless; Cloud computing security; Operating system","score_opus":0.08978625928106038,"score_gpt":0.3384160963105107,"score_spread":0.2486298370294503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317385005","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018817806,0.014812514,0.0010212236,0.021408582,0.956762,0.00004559302,0.00006410347,0.00012882154,0.0055689667],"genre_scores_gemma":[0.0014950584,0.015832664,0.00027652623,0.006946915,0.96520054,0.000027828512,0.00004587494,0.000054654665,0.010119994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984976,0.00014338514,0.00012342102,0.00026325224,0.000811852,0.0001604426],"domain_scores_gemma":[0.99450326,0.001664217,0.00026385745,0.00017163131,0.0023300967,0.0010669079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022513426,0.0017819699,0.0012105296,0.0013148747,0.0012809822,0.005081956,0.0022068121,0.005297594,0.012493753],"category_scores_gemma":[0.005185928,0.0005196312,0.0012241306,0.0006764734,0.001396423,0.003085647,0.0010502142,0.009709229,0.008667251],"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.0000557011,0.000025835869,0.000063500884,0.0003869475,0.000014518242,0.00019403973,0.000016903437,0.00016911556,0.00035374454,0.0017249475,0.9806636,0.016331155],"study_design_scores_gemma":[0.000024666724,0.00007618129,0.00017346613,0.00024334416,0.00002347873,0.00038042598,0.000027207816,0.00048194596,0.0003761246,0.0016452264,0.9965295,0.000018488483],"about_ca_topic_score_codex":0.0005898153,"about_ca_topic_score_gemma":0.0007467641,"teacher_disagreement_score":0.012493753,"about_ca_system_score_codex":0.0012439147,"about_ca_system_score_gemma":0.0012265828,"threshold_uncertainty_score":0.04179579},"labels":[],"label_agreement":null},{"id":"W4318586163","doi":"10.1109/jsac.2023.3240710","title":"Rate-Splitting for Intelligent Reflecting Surface-Aided Multiuser VR Streaming","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Quality of service; Leverage (statistics); Bottleneck; Virtual reality; Wireless network; Artificial intelligence; Real-time computing; Wireless; Computer network; Telecommunications; Embedded system","score_opus":0.09754646114303962,"score_gpt":0.3647560459801093,"score_spread":0.2672095848370697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318586163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04326875,0.00033094428,0.9516937,0.0001681404,0.000055241922,0.000060786748,0.000057620826,0.0015777722,0.0027869951],"genre_scores_gemma":[0.87679046,0.00018466606,0.12060007,0.00016012011,0.000038189308,0.000067828485,0.00012066576,0.00009163183,0.0019464515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00008013149,0.000019045954,0.000081774386,0.00012062707,0.00005469587],"domain_scores_gemma":[0.9995384,0.00016678577,0.00004740411,0.00007685147,0.00012122878,0.000049344162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005248839,0.00055323564,0.00060487364,0.00022540732,0.00026079244,0.00051912054,0.0011954597,0.0005218894,0.0020590022],"category_scores_gemma":[0.0017237583,0.00021658369,0.00033513087,0.00023676774,0.0004308094,0.00091852964,0.0010074367,0.0009596856,0.00054060825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062135025,0.00026260395,0.0018524133,0.00014711554,0.000068231726,0.00042331655,0.00029161174,0.5170097,0.084812455,0.010039133,0.0045703016,0.37990174],"study_design_scores_gemma":[0.000011148238,0.000049302736,0.00009096155,0.0000036299011,0.0000045830884,0.000054806504,0.000010474439,0.9930199,0.0049054916,0.0012543055,0.0005869252,0.000008573809],"about_ca_topic_score_codex":0.0024517833,"about_ca_topic_score_gemma":0.0025653963,"teacher_disagreement_score":0.0024517833,"about_ca_system_score_codex":0.0004071669,"about_ca_system_score_gemma":0.0005110243,"threshold_uncertainty_score":0.0068880916},"labels":[],"label_agreement":null},{"id":"W4318586278","doi":"10.1109/jsac.2023.3240709","title":"Asynchronous Cell-Free Massive MIMO With Rate-Splitting","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":112,"is_retracted":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; Australian Research Council; Natural Science Foundation of Beijing Municipality; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; ZTE Corporation","keywords":"Precoding; Asynchronous communication; Computer science; MIMO; Telecommunications link; Robustness (evolution); Channel state information; Spectral efficiency; Transmission (telecommunications); Topology (electrical circuits); Channel (broadcasting); Computer network; Telecommunications; Wireless; Mathematics","score_opus":0.016701361423620185,"score_gpt":0.25007400604301405,"score_spread":0.23337264461939386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318586278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061082736,0.00022031894,0.9341837,0.00009052121,0.000040066774,0.000032825592,0.00005606146,0.00019978955,0.0040940447],"genre_scores_gemma":[0.92385787,0.00021333162,0.07394274,0.000076536606,0.000046615,0.00004657612,0.00006234701,0.000014079404,0.001739874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996105,0.00012613971,0.000012621497,0.00007144941,0.00013003539,0.000049272625],"domain_scores_gemma":[0.99950075,0.00018421045,0.00009504033,0.0000862077,0.000097093005,0.00003665389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043874932,0.000698685,0.00034282936,0.00015038173,0.0002217168,0.00049115316,0.00064344273,0.00042262895,0.00058308284],"category_scores_gemma":[0.0008810578,0.00023712782,0.00031442477,0.00037279865,0.00046806876,0.0005483865,0.00055867614,0.00045522887,0.00032238578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028928602,0.00011087431,0.0010132457,0.00016950871,0.00006383245,0.00041153983,0.00017295453,0.801329,0.08587018,0.04604033,0.0013035487,0.06322565],"study_design_scores_gemma":[0.000014417634,0.00013830022,0.00015989297,0.0000062826994,0.000010777835,0.000095734205,0.000011874685,0.987773,0.007145266,0.004010796,0.0006196437,0.000013912298],"about_ca_topic_score_codex":0.0005367425,"about_ca_topic_score_gemma":0.0008109493,"teacher_disagreement_score":0.000698685,"about_ca_system_score_codex":0.0002938888,"about_ca_system_score_gemma":0.00033592564,"threshold_uncertainty_score":0.0023203492},"labels":[],"label_agreement":null},{"id":"W4319302934","doi":"10.1109/jsac.2023.3242721","title":"GIFT: Toward Accurate and Efficient Federated Learning With Gradient-Instructed Frequency Tuning","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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":"Chinese University of Hong Kong; Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Computer science; Consistency (knowledge bases); Synchronization (alternating current); Metric (unit); Convergence (economics); Stability (learning theory); Distributed computing; Artificial intelligence; Real-time computing; Machine learning; Telecommunications","score_opus":0.05213281843376082,"score_gpt":0.2990192269054298,"score_spread":0.24688640847166898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319302934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030166168,0.0002667835,0.9592043,0.00036274854,0.00007351303,0.00007081144,0.00009842049,0.0084833605,0.0012738301],"genre_scores_gemma":[0.7679547,0.0001178006,0.229129,0.0003727859,0.000052679916,0.00013926935,0.00033575392,0.0003844459,0.0015135319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809116,0.0005844524,0.00012017846,0.00045358448,0.00049973914,0.0002509514],"domain_scores_gemma":[0.99668676,0.0012451271,0.00025049242,0.0011121775,0.00049462693,0.0002108147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030279646,0.0010497785,0.001161353,0.0006242519,0.0006631975,0.0013363296,0.0025514294,0.0012645718,0.0015859711],"category_scores_gemma":[0.012284981,0.00047046976,0.00052729214,0.00064380706,0.0011624902,0.0028463425,0.0027730798,0.0022344198,0.0007010071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008118889,0.00034835917,0.0039730747,0.0001405008,0.00010522521,0.0001617623,0.00021017494,0.74144435,0.0089677805,0.013972443,0.008148431,0.221716],"study_design_scores_gemma":[0.000032638276,0.000032002845,0.00011196743,0.000005224121,0.0000050390313,0.00002588078,0.000017366125,0.99121726,0.0019353369,0.006107839,0.0005030935,0.0000063797447],"about_ca_topic_score_codex":0.0039478773,"about_ca_topic_score_gemma":0.004185063,"teacher_disagreement_score":0.0039478773,"about_ca_system_score_codex":0.0009215697,"about_ca_system_score_gemma":0.0022007318,"threshold_uncertainty_score":0.016013563},"labels":[],"label_agreement":null},{"id":"W4319778953","doi":"10.1109/jsac.2023.3242704","title":"Split Learning Over Wireless Networks: Parallel Design and Resource Management","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":253,"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; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Natural Science Foundation of China; Peng Cheng Laboratory","keywords":"Computer science; Latency (audio); Cluster analysis; Artificial intelligence; Partition (number theory); Wireless; Machine learning; Computer network; Operating system; Telecommunications","score_opus":0.05177587151592061,"score_gpt":0.3009152761501048,"score_spread":0.24913940463418421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319778953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021740535,0.00023540534,0.97136873,0.00033058465,0.000062421255,0.00015227798,0.000043285385,0.0016105702,0.004456133],"genre_scores_gemma":[0.7276198,0.00032542576,0.26576355,0.00023515752,0.0000724175,0.0003915387,0.00018200722,0.00017754805,0.0052325404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986268,0.00034764633,0.000084636034,0.00034079302,0.00034777267,0.00025236176],"domain_scores_gemma":[0.998159,0.00060860097,0.00013973254,0.0005295555,0.0004132269,0.000149938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017325026,0.00088691,0.000761122,0.0006190269,0.0008236816,0.0016350711,0.0025681548,0.0006398116,0.004356974],"category_scores_gemma":[0.0036896912,0.00052638474,0.0005574795,0.00067224266,0.0011346666,0.0034757145,0.0018753285,0.0014348044,0.0008064697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052569166,0.00033724267,0.0018798544,0.000151145,0.00008345109,0.00014039602,0.0002136635,0.6371456,0.008070654,0.041507058,0.0066196816,0.3033255],"study_design_scores_gemma":[0.000016857115,0.00005678311,0.00006122884,0.0000042589522,0.000008016347,0.000022403081,0.000018513178,0.9895326,0.0018848133,0.00733883,0.0010509561,0.000004817431],"about_ca_topic_score_codex":0.0043481253,"about_ca_topic_score_gemma":0.005595502,"teacher_disagreement_score":0.004356974,"about_ca_system_score_codex":0.0018147116,"about_ca_system_score_gemma":0.0021698258,"threshold_uncertainty_score":0.014575541},"labels":[],"label_agreement":null},{"id":"W4375928939","doi":"10.1109/jsac.2023.3273707","title":"Uplink Multiple Access With Semi-Grant-Free Transmission in Integrated Satellite-Aerial-Terrestrial Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Concordia University","funders":"Nanjing University of Posts and Telecommunications; Government of Jiangsu Province","keywords":"Computer science; Telecommunications link; Channel state information; Transmission (telecommunications); Computer network; Space-division multiple access; Throughput; Channel (broadcasting); Telecommunications; Wireless","score_opus":0.0567388413156029,"score_gpt":0.297409196982388,"score_spread":0.24067035566678507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375928939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095699005,0.0023412786,0.894939,0.00023164802,0.00009031492,0.00008929303,0.00008095468,0.0002678598,0.006260605],"genre_scores_gemma":[0.9526186,0.0006748563,0.045325745,0.000067154,0.000052803713,0.00007886458,0.00004176918,0.000009175997,0.0011310978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986965,0.00057474023,0.000046274537,0.00016531676,0.00033188722,0.00018523996],"domain_scores_gemma":[0.99864703,0.0006919995,0.00024011575,0.00012572152,0.00024768044,0.000047351492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433189,0.0007667913,0.00059529924,0.00052146777,0.0007052201,0.00087344093,0.0011148109,0.00059840264,0.0008673803],"category_scores_gemma":[0.0022821873,0.000256257,0.0003757904,0.0011057972,0.0010147169,0.001086141,0.0011334842,0.0005330604,0.00017849752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003428526,0.00014811655,0.0027944122,0.0005365821,0.00016719122,0.0011830181,0.0006142183,0.73715526,0.024481773,0.09083994,0.0023872657,0.13934928],"study_design_scores_gemma":[0.00002451923,0.00013111056,0.00025496734,0.000015649968,0.000025828283,0.00024198528,0.0000740063,0.9900032,0.0017533151,0.0062475433,0.0012015289,0.000026410191],"about_ca_topic_score_codex":0.00325364,"about_ca_topic_score_gemma":0.004485718,"teacher_disagreement_score":0.00325364,"about_ca_system_score_codex":0.0006127978,"about_ca_system_score_gemma":0.0007224889,"threshold_uncertainty_score":0.0064694285},"labels":[],"label_agreement":null},{"id":"W4381785946","doi":"10.1109/jsac.2023.3288234","title":"Robust Downlink Transmission Design in IRS-Assisted Cognitive Satellite and Terrestrial Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Nanjing University of Posts and Telecommunications","keywords":"Computer science; Telecommunications link; Transmitter power output; Beamforming; Optimization problem; Computer network; Transmission (telecommunications); Telecommunications; Channel (broadcasting); Algorithm; Transmitter","score_opus":0.08153706500072104,"score_gpt":0.29405455867421515,"score_spread":0.2125174936734941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381785946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010135201,0.00019115616,0.9870536,0.000076979784,0.000022404658,0.000016751277,0.000024573988,0.00009048222,0.002388863],"genre_scores_gemma":[0.8771031,0.00049871806,0.119749784,0.00012339454,0.00006126115,0.00011142678,0.00009267587,0.000038049773,0.0022215182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993255,0.00020982815,0.00002403858,0.00012164078,0.00021772864,0.00010121972],"domain_scores_gemma":[0.9995142,0.00019657055,0.000091155845,0.000037314934,0.00013625655,0.000024476678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000734139,0.00083567057,0.00056027295,0.00033103648,0.00036672904,0.0008512938,0.0009264232,0.00066040334,0.0010698325],"category_scores_gemma":[0.0015747007,0.0002993856,0.0004288312,0.00053061877,0.0006866372,0.0007835339,0.0007386777,0.0006855874,0.00028818083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010013025,0.000028368771,0.0004361048,0.00010323742,0.00003793469,0.00013842928,0.00009570034,0.925305,0.009685744,0.018516134,0.00096170243,0.04459158],"study_design_scores_gemma":[0.0000059891095,0.000038930517,0.000048270867,0.0000037911855,0.000007343611,0.000027482594,0.000013455823,0.99706537,0.0011056712,0.0013468361,0.00033160314,0.00000524051],"about_ca_topic_score_codex":0.002939644,"about_ca_topic_score_gemma":0.002181515,"teacher_disagreement_score":0.002939644,"about_ca_system_score_codex":0.00074398925,"about_ca_system_score_gemma":0.0008873102,"threshold_uncertainty_score":0.00584507},"labels":[],"label_agreement":null},{"id":"W4381785968","doi":"10.1109/jsac.2023.3288269","title":"Super-Wideband Massive MIMO","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Antenna Design and Analysis","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Futurewei Technologies; National Science Foundation","keywords":"MIMO; Computer science; Wideband; 3G MIMO; Bandwidth (computing); Electronic engineering; Antenna noise temperature; Antenna array; Antenna (radio); Topology (electrical circuits); Telecommunications; Omnidirectional antenna; Antenna efficiency; Electrical engineering; Channel (broadcasting); Engineering","score_opus":0.03266448274842102,"score_gpt":0.27212501140766626,"score_spread":0.23946052865924525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381785968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017189197,0.0006742691,0.95156276,0.00047928587,0.00015637782,0.000027629792,0.00017867186,0.00022104035,0.029510882],"genre_scores_gemma":[0.88892204,0.0018681674,0.079117,0.0008832454,0.00038857423,0.00018964986,0.00021370503,0.00009469204,0.028322896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996747,0.00008897472,0.000009441158,0.000058489386,0.00011889409,0.00004954877],"domain_scores_gemma":[0.9997384,0.00007985734,0.000046711022,0.00005679407,0.000053445623,0.000024878309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028676385,0.00074657914,0.000536622,0.00031137426,0.00027327656,0.0010815845,0.0010223064,0.0010841463,0.0027334758],"category_scores_gemma":[0.00072369515,0.00032077712,0.000564474,0.0004280338,0.00073849823,0.0012998123,0.0010217655,0.0010704309,0.0011617086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050251572,0.000035443263,0.00052082096,0.000114119764,0.000041793603,0.00036913005,0.00014880163,0.5489791,0.012798183,0.4214334,0.003483807,0.012025156],"study_design_scores_gemma":[0.0000067307305,0.000047530375,0.00016487903,0.000012513171,0.000012361222,0.00016348301,0.000031248805,0.946401,0.00071710366,0.04813416,0.0042954287,0.000013505355],"about_ca_topic_score_codex":0.0008396451,"about_ca_topic_score_gemma":0.0008252521,"teacher_disagreement_score":0.0027334758,"about_ca_system_score_codex":0.00057606876,"about_ca_system_score_gemma":0.00027683593,"threshold_uncertainty_score":0.009144366},"labels":[],"label_agreement":null},{"id":"W4382119085","doi":"10.1109/jsac.2023.3288231","title":"Semantic Communications for Wireless Sensing: RIS-Aided Encoding and Self-Supervised Decoding","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"University of Waterloo","funders":"Guangdong Provincial Pearl River Talents Program; Ministry of Education - Singapore; National Science Foundation, United Arab Emirates; National Natural Science Foundation of China; Ministry of Science and ICT, South Korea; National Science Foundation","keywords":"Computer science; Decoding methods; Encoding (memory); Hash function; Wireless; Sampling (signal processing); Artificial intelligence; Algorithm; Computer vision; Telecommunications","score_opus":0.0427583445251397,"score_gpt":0.2913943387866181,"score_spread":0.24863599426147837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382119085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02453238,0.00017875237,0.97229296,0.00011334151,0.00003915999,0.000027491707,0.000030522628,0.0005741965,0.0022113058],"genre_scores_gemma":[0.58483046,0.00032598255,0.41084945,0.00020391669,0.00008693254,0.00012848213,0.00019028745,0.00012367807,0.0032607974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996191,0.00007192299,0.000026819174,0.00007726814,0.00016614469,0.000038754202],"domain_scores_gemma":[0.99947053,0.00016852918,0.00008128799,0.00014055072,0.00012014903,0.000019007653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003499867,0.0005645679,0.0003427483,0.00041853287,0.00022368642,0.0005800442,0.00062579144,0.0005007135,0.00091667037],"category_scores_gemma":[0.0013282348,0.00017873137,0.00034946026,0.00049810007,0.0006764154,0.001274991,0.0007121816,0.00059873954,0.0004203135],"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.0004072121,0.0001362063,0.0016298972,0.00026813033,0.000036655063,0.00023451423,0.00046949636,0.0821676,0.3879549,0.070357,0.0021329776,0.45420542],"study_design_scores_gemma":[0.000026745225,0.00028989572,0.0006142242,0.000024440165,0.000029338886,0.0003325554,0.00008901134,0.7210133,0.25290734,0.015292786,0.009330488,0.000049910264],"about_ca_topic_score_codex":0.0004472108,"about_ca_topic_score_gemma":0.0005459348,"teacher_disagreement_score":0.00091667037,"about_ca_system_score_codex":0.00034861188,"about_ca_system_score_gemma":0.00040830308,"threshold_uncertainty_score":0.0030665398},"labels":[],"label_agreement":null},{"id":"W4383199388","doi":"10.1109/jsac.2023.3282543","title":"Guest Editorial xURLLC in 6G: Next Generation Ultra-Reliable and Low-Latency Communications","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Age of Information Optimization","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Low latency (capital markets); Performance indicator; Telecommunications; Efficient energy use; Reliability (semiconductor); Computer network; Power (physics); Engineering","score_opus":0.03783894875347228,"score_gpt":0.2957146563548993,"score_spread":0.25787570760142703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383199388","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007510156,0.0042242217,0.00025918556,0.018761732,0.9733541,0.000023068525,0.00004131463,0.00007268508,0.0031886068],"genre_scores_gemma":[0.0006305048,0.0049810633,0.00012742597,0.009213206,0.970565,0.0000178107,0.000029439074,0.000038971655,0.0143965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977695,0.00025887767,0.00023784924,0.0003019385,0.001235685,0.00019610299],"domain_scores_gemma":[0.9932094,0.0019370372,0.0004386892,0.00017185142,0.0030829546,0.001160026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029093898,0.0028649715,0.0023156616,0.002069229,0.0018485104,0.005430414,0.0021270046,0.008699381,0.015020983],"category_scores_gemma":[0.008514495,0.0006996855,0.0016378266,0.0010018164,0.0014911536,0.0033131153,0.0010062471,0.013914844,0.014584682],"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.00004462413,0.000016459831,0.000028109804,0.00025106853,0.000011248473,0.00018329422,0.000010555049,0.000049763155,0.00015224796,0.00064340973,0.98962855,0.008980772],"study_design_scores_gemma":[0.00002789337,0.00003834252,0.00016849485,0.00022903371,0.000020050911,0.00031919804,0.000025484083,0.00018245485,0.00021949211,0.0008829729,0.9978719,0.000014839495],"about_ca_topic_score_codex":0.00058738224,"about_ca_topic_score_gemma":0.0015137705,"teacher_disagreement_score":0.015020983,"about_ca_system_score_codex":0.0015324638,"about_ca_system_score_gemma":0.0015161898,"threshold_uncertainty_score":0.050250232},"labels":[],"label_agreement":null},{"id":"W4386275635","doi":"10.1109/jsac.2023.3310104","title":"A New Virtual Network Topology-Based Digital Twin for Spatial-Temporal Load-Balanced User Association in 6G HetNets","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Heterogeneous network; Computer network; Quality of service; Network topology; Distributed computing; Provisioning; Wireless network; Wireless","score_opus":0.018024605670591737,"score_gpt":0.2734062061041156,"score_spread":0.25538160043352387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386275635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02165693,0.00010669052,0.97641516,0.000049365597,0.000041420095,0.000026986985,0.000066247856,0.00024588962,0.0013913641],"genre_scores_gemma":[0.63222456,0.00035778177,0.3637057,0.000099193276,0.000051952917,0.00010720441,0.00053619285,0.00010312904,0.0028143704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.00014636133,0.00003094983,0.0001424014,0.00014486269,0.000052637093],"domain_scores_gemma":[0.9993005,0.00016426099,0.00010097239,0.00015352348,0.00019528439,0.00008546783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058268756,0.00068660907,0.0008306345,0.0010201106,0.00065875804,0.0011058174,0.0013276562,0.0005911449,0.0013939543],"category_scores_gemma":[0.0022802413,0.00042132038,0.00059682236,0.0011497232,0.0005721977,0.0025908302,0.0019058498,0.00065222976,0.0003659232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002634465,0.00010371167,0.0059847385,0.0001324571,0.000093542025,0.00035332,0.0002284716,0.64968497,0.022186898,0.0485806,0.0030463,0.26934165],"study_design_scores_gemma":[0.0000053797194,0.000039552142,0.0002550681,0.000004410145,0.00001614232,0.00012228441,0.000025278774,0.99209034,0.001976164,0.004297984,0.001154561,0.000012900008],"about_ca_topic_score_codex":0.0018817703,"about_ca_topic_score_gemma":0.0025040265,"teacher_disagreement_score":0.0018817703,"about_ca_system_score_codex":0.0005521141,"about_ca_system_score_gemma":0.0007004941,"threshold_uncertainty_score":0.004663229},"labels":[],"label_agreement":null},{"id":"W4386275784","doi":"10.1109/jsac.2023.3310106","title":"Differentially Private Federated Multi-Task Learning Framework for Enhancing Human-to-Virtual Connectivity in Human Digital Twin","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","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":"Concordia University","funders":"Concordia University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scheme (mathematics); Task (project management); Process (computing); Differential privacy; Distributed computing; Artificial intelligence; Human–computer interaction; Data mining","score_opus":0.05470206361391927,"score_gpt":0.3433514664349823,"score_spread":0.28864940282106305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386275784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032233965,0.00012375343,0.96588355,0.00024225703,0.000026201638,0.000043060176,0.000041768122,0.00029007896,0.0011152792],"genre_scores_gemma":[0.93873894,0.00008219729,0.05936615,0.000090367466,0.000021616393,0.00006414255,0.00006613411,0.000025399167,0.0015450993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980484,0.00070083543,0.000094161274,0.00044425498,0.00041340737,0.00029887227],"domain_scores_gemma":[0.9970222,0.001282732,0.00028607892,0.00080613396,0.00036307247,0.00023975162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031049615,0.0005473178,0.0010184617,0.0004484327,0.00092181476,0.0013392983,0.001967915,0.0013208236,0.0015845689],"category_scores_gemma":[0.0074859327,0.00024502442,0.0004558585,0.0006907755,0.0014370736,0.0037031407,0.0033638396,0.001554934,0.0002636286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051804254,0.00023190468,0.002134508,0.00008492924,0.000054746914,0.0003464384,0.0003281349,0.7957491,0.0050024223,0.07061353,0.0018460978,0.12309011],"study_design_scores_gemma":[0.000011224343,0.000042556694,0.000088014094,0.0000030828965,0.00000579044,0.000041285417,0.00001526908,0.98067987,0.0009120207,0.017803295,0.000391513,0.000006166808],"about_ca_topic_score_codex":0.0023757785,"about_ca_topic_score_gemma":0.002024945,"teacher_disagreement_score":0.0031049615,"about_ca_system_score_codex":0.00110928,"about_ca_system_score_gemma":0.0017547221,"threshold_uncertainty_score":0.016420782},"labels":[],"label_agreement":null},{"id":"W4386275825","doi":"10.1109/jsac.2023.3310087","title":"Distributed Communication and Computation Resource Management for Digital Twin-Aided Edge Computing With Short-Packet Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":30,"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; Royal Academy of Engineering","keywords":"Computer science; Computer network; Network packet; Distributed computing; Enhanced Data Rates for GSM Evolution; Resource management (computing); Computation; Packet switching; Telecommunications","score_opus":0.050047076439598895,"score_gpt":0.3169205034312723,"score_spread":0.26687342699167343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386275825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01731354,0.0003912043,0.9791877,0.00017906383,0.000058442976,0.000031229898,0.00002161518,0.00012737355,0.0026898542],"genre_scores_gemma":[0.80266416,0.00045460265,0.19253142,0.0001330651,0.00007120397,0.00010295554,0.00006951495,0.000054266642,0.0039187763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959236,0.00011245546,0.000017437429,0.00010862895,0.000104181,0.000065040236],"domain_scores_gemma":[0.9997272,0.00011490283,0.00003470306,0.00004101373,0.000052758536,0.000029381297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071841414,0.00043249023,0.0004770965,0.00024565365,0.000544101,0.0009974963,0.0011363205,0.00052710774,0.0014520584],"category_scores_gemma":[0.0012046065,0.00017724012,0.0003003316,0.00054271595,0.00056398165,0.0011321094,0.0012290996,0.0008251746,0.0001762292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020268127,0.000088617206,0.00079405843,0.000121024896,0.00004050364,0.00019839706,0.00017598105,0.80405295,0.010877211,0.058905266,0.003182401,0.12136097],"study_design_scores_gemma":[0.0000056724575,0.00002502641,0.0000729568,0.000003249807,0.000004867728,0.000025543728,0.000021315589,0.9905571,0.0009383338,0.0070690513,0.0012720998,0.0000047380695],"about_ca_topic_score_codex":0.0022336831,"about_ca_topic_score_gemma":0.00319079,"teacher_disagreement_score":0.0022336831,"about_ca_system_score_codex":0.0008057588,"about_ca_system_score_gemma":0.0011659848,"threshold_uncertainty_score":0.005846262},"labels":[],"label_agreement":null},{"id":"W4386280779","doi":"10.1109/jsac.2023.3310109","title":"Digital Twins Based Intelligent State Prediction Method for Maneuvering-Target Tracking","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Imaging and Spectroscopy Techniques","field":"Medicine","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":"Exfo Electro-Optical Engineering (Canada)","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Liuzhou Science and Technology Project; Guangdong Science and Technology Department; Science, Technology and Innovation Commission of Shenzhen Municipality; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Tracking (education); Artificial intelligence; Generalization; Artificial neural network; Noise (video); Motion (physics); Computer vision; Tracking system; State (computer science); Pattern recognition (psychology); Kalman filter; Algorithm; Image (mathematics); Mathematics","score_opus":0.0591814001899333,"score_gpt":0.39299520975840796,"score_spread":0.3338138095684747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386280779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017861733,0.00009432402,0.9800575,0.000052381598,0.00004726149,0.000023572844,0.000036078924,0.0005599885,0.0012670764],"genre_scores_gemma":[0.78987205,0.00020312253,0.20516677,0.00008660596,0.000032865173,0.000100544996,0.00020167681,0.000052791525,0.00428364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974686,0.00002289673,0.000018993065,0.00010209009,0.00008573472,0.000023486207],"domain_scores_gemma":[0.9997812,0.000044486693,0.000030888532,0.000038155667,0.00008881193,0.000016538515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031018644,0.00052002183,0.0005117057,0.00044306807,0.00045721722,0.00048803224,0.0008269177,0.00043989977,0.0018793555],"category_scores_gemma":[0.0009263384,0.00027804315,0.00042100562,0.0004195625,0.0003218456,0.0011539469,0.0008396339,0.0006812526,0.00031041866],"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.00030886204,0.00010287147,0.004149199,0.00011662402,0.00007417954,0.00024954954,0.00019860904,0.46102,0.032815248,0.012354951,0.0025106953,0.48609924],"study_design_scores_gemma":[0.0000045132097,0.00002751097,0.00021066847,0.0000021083385,0.00001086466,0.0000333038,0.0000053067865,0.9957722,0.0027509504,0.0007406501,0.00043621953,0.000005761742],"about_ca_topic_score_codex":0.005087219,"about_ca_topic_score_gemma":0.0043304614,"teacher_disagreement_score":0.005087219,"about_ca_system_score_codex":0.0004890863,"about_ca_system_score_gemma":0.0006467978,"threshold_uncertainty_score":0.010115206},"labels":[],"label_agreement":null},{"id":"W4386280880","doi":"10.1109/jsac.2023.3310097","title":"Digital Twin Empowered Wireless Healthcare Monitoring for Smart Home","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":150,"is_retracted":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":"Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Wearable computer; Smartwatch; Home automation; Visualization; Process (computing); Human–computer interaction; Fidelity; Embedded system; Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.06508742822763808,"score_gpt":0.337608752088192,"score_spread":0.27252132386055394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386280880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059510063,0.00034217385,0.93429244,0.00019578983,0.00008794072,0.00004929139,0.00012612723,0.001160496,0.004235801],"genre_scores_gemma":[0.9082714,0.00041657098,0.08734699,0.00011092461,0.00003362742,0.000046850022,0.00019427112,0.00003651928,0.0035428817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.000034638266,0.000009109598,0.000045969628,0.00006066117,0.000015352369],"domain_scores_gemma":[0.9999132,0.00002054491,0.000010417534,0.00001915588,0.000025427638,0.000011277325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022645638,0.0003844403,0.00036176437,0.0003022066,0.00015666221,0.00059417065,0.00044252863,0.00041670058,0.0011242304],"category_scores_gemma":[0.00049946335,0.00015449355,0.00031509157,0.00029863731,0.00021297182,0.0010821482,0.00077843823,0.00036142842,0.00029941616],"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.0007288393,0.00034607868,0.016742934,0.00025786436,0.00009475088,0.000590495,0.00025714436,0.4052779,0.080253325,0.025384864,0.0074798386,0.46258608],"study_design_scores_gemma":[0.000008044793,0.000114094655,0.0012077139,0.0000068609006,0.0000184399,0.00017139777,0.00002035128,0.9881344,0.0052049863,0.002387403,0.0027148125,0.000011495436],"about_ca_topic_score_codex":0.0017628068,"about_ca_topic_score_gemma":0.0019295648,"teacher_disagreement_score":0.0017628068,"about_ca_system_score_codex":0.00027240955,"about_ca_system_score_gemma":0.00027628193,"threshold_uncertainty_score":0.0037609339},"labels":[],"label_agreement":null},{"id":"W4387303325","doi":"10.1109/jsac.2023.3310046","title":"Digital Twin Enhanced Federated Reinforcement Learning With Lightweight Knowledge Distillation in Mobile Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Japan Society for the Promotion of Science; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Cloud computing; Distributed computing; Edge device; Edge computing; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Operating system","score_opus":0.027664556179792722,"score_gpt":0.29365498016363,"score_spread":0.26599042398383727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387303325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062404193,0.00033178253,0.93420494,0.00022928533,0.00005864274,0.000038421786,0.000036934685,0.0005798787,0.0021159137],"genre_scores_gemma":[0.9664618,0.000067553075,0.0321542,0.00007669059,0.000012815025,0.000039406514,0.000031106243,0.000015071634,0.0011414476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958366,0.00010135368,0.000020435802,0.00011258174,0.00008225581,0.00009980194],"domain_scores_gemma":[0.9993948,0.00025806934,0.000079961246,0.0000808371,0.00012861248,0.00005772287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903324,0.000550466,0.0007818297,0.00019812261,0.0003796579,0.0007780474,0.0011633497,0.00068815995,0.0010019491],"category_scores_gemma":[0.0017996671,0.00025230457,0.00031725856,0.00023734588,0.0007694916,0.00090548064,0.0012098632,0.0011121522,0.00017889777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014550057,0.000069351416,0.00053519453,0.00003960636,0.000022944667,0.00008695282,0.0000495071,0.9520511,0.0026726571,0.0060030846,0.0005562863,0.037767723],"study_design_scores_gemma":[0.0000043817727,0.000014189932,0.000027363392,0.0000012719936,0.000002077876,0.0000039793777,0.000002257299,0.9985337,0.00030790866,0.0010247744,0.0000764343,0.0000015357342],"about_ca_topic_score_codex":0.0058388696,"about_ca_topic_score_gemma":0.0045479955,"teacher_disagreement_score":0.0058388696,"about_ca_system_score_codex":0.0006956115,"about_ca_system_score_gemma":0.0010990624,"threshold_uncertainty_score":0.011609793},"labels":[],"label_agreement":null},{"id":"W4387448622","doi":"10.1109/jsac.2023.3322841","title":"FL-AMM: Federated Learning Augmented Map Matching With Heterogeneous Cellular Moving Trajectories","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Traffic Prediction and Management Techniques","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 Waterloo; University of Calgary","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China; China Association for Science and Technology; Central South University; University of Calgary","keywords":"Computer science; Map matching; Matching (statistics); Data mining; Robustness (evolution); Component (thermodynamics); Artificial intelligence","score_opus":0.016514252968676552,"score_gpt":0.24202790760895954,"score_spread":0.22551365464028297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387448622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0448379,0.00008224815,0.9501891,0.00019605349,0.00005041345,0.00010617931,0.0002510745,0.0028969552,0.0013899319],"genre_scores_gemma":[0.7304203,0.00004884099,0.26568183,0.00017966423,0.000040783547,0.00016511936,0.0008839863,0.000086926026,0.0024926574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800926,0.0005404898,0.00012158419,0.00059334654,0.00046417577,0.0002711401],"domain_scores_gemma":[0.9974251,0.0006864206,0.00025386474,0.0009849386,0.0005167883,0.00013303901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022269068,0.00094650325,0.0013059916,0.001077362,0.0007778662,0.0014025237,0.003015477,0.0015344591,0.0016725973],"category_scores_gemma":[0.0073796026,0.00039931282,0.00091067323,0.0017000078,0.0007919593,0.002874524,0.0034361768,0.0012837137,0.00055815186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043369408,0.00031825955,0.0050862003,0.00005063427,0.000121118035,0.00013454731,0.00010471721,0.7334128,0.0026561802,0.0070618363,0.0026894503,0.2479306],"study_design_scores_gemma":[0.000009145689,0.00003192076,0.00022619686,0.0000016484838,0.0000054311663,0.000016472493,0.000011395222,0.99568653,0.0008229052,0.0027470093,0.00043634593,0.000005029378],"about_ca_topic_score_codex":0.014655409,"about_ca_topic_score_gemma":0.011256543,"teacher_disagreement_score":0.014655409,"about_ca_system_score_codex":0.0012419258,"about_ca_system_score_gemma":0.0015590837,"threshold_uncertainty_score":0.029140234},"labels":[],"label_agreement":null},{"id":"W4387449140","doi":"10.1109/jsac.2023.3322797","title":"Cooperative Localization for UAV Systems From the Perspective of Physical Clock Synchronization","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization 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":"Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Ranging; Computer science; Pseudorange; Clock synchronization; Synchronization (alternating current); Clock drift; Real-time computing; Global Positioning System; Time of arrival; Control theory (sociology); GNSS applications; Artificial intelligence; Telecommunications","score_opus":0.02516528724701056,"score_gpt":0.2875835563896013,"score_spread":0.26241826914259075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387449140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023069872,0.00046250803,0.9743377,0.00010073364,0.000044271153,0.0000141966375,0.000010900761,0.00015633297,0.0018035553],"genre_scores_gemma":[0.9661529,0.0005469067,0.03184284,0.000029911296,0.00004467698,0.0000401814,0.000021033246,0.000011942545,0.0013095904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.0000852661,0.00001144255,0.0000848889,0.00009155441,0.000039374056],"domain_scores_gemma":[0.9997898,0.000071197,0.000052851574,0.000031457734,0.00004477664,0.000009990866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027629617,0.00036106922,0.00033421133,0.00026867233,0.00033632922,0.0005999849,0.0005158967,0.00044125502,0.00050165557],"category_scores_gemma":[0.0010061647,0.00015478255,0.0003246936,0.00036757658,0.0004650151,0.00076748873,0.0007834309,0.00037774304,0.00013292946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013191065,0.000037390688,0.0018723707,0.00016828242,0.000051722323,0.00035994663,0.00042243686,0.7996775,0.03651613,0.051777326,0.0010557241,0.1079293],"study_design_scores_gemma":[0.000008379318,0.00008060522,0.00030399268,0.0000064415303,0.0000135809,0.00006392405,0.000047003745,0.99237424,0.002165793,0.0035274955,0.001400586,0.00000804226],"about_ca_topic_score_codex":0.0025238467,"about_ca_topic_score_gemma":0.0016772234,"teacher_disagreement_score":0.0025238467,"about_ca_system_score_codex":0.00034625988,"about_ca_system_score_gemma":0.0004823106,"threshold_uncertainty_score":0.005018294},"labels":[],"label_agreement":null},{"id":"W4387449261","doi":"10.1109/jsac.2023.3322818","title":"Simultaneous Localization and Communications With Massive MIMO-OTFS","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"PAPR reduction in OFDM","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":"Simon Fraser University; University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"National Natural Science Foundation of China","keywords":"MIMO; Computer science; Orthogonal frequency-division multiplexing; Robustness (evolution); Channel (broadcasting); Fading; MIMO-OFDM; Algorithm; Electronic engineering; Transmission (telecommunications); Telecommunications; Engineering","score_opus":0.023838504926479247,"score_gpt":0.2784736615593145,"score_spread":0.25463515663283526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387449261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02247841,0.00019296745,0.97467244,0.00011915495,0.000036235906,0.000014234668,0.00003971853,0.00022305812,0.002223677],"genre_scores_gemma":[0.9209316,0.0003433472,0.07654771,0.00007900542,0.00003894563,0.00005646262,0.000054016382,0.000015535354,0.001933384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953175,0.00011082983,0.000013447261,0.00006763394,0.00019793084,0.00007846685],"domain_scores_gemma":[0.9995215,0.00021445216,0.000083714236,0.000075280215,0.0000803806,0.000024544408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034206428,0.0005165393,0.00047569827,0.00029860542,0.00038906976,0.0005855006,0.00054085196,0.00049348077,0.00078147074],"category_scores_gemma":[0.0011987642,0.00019268865,0.00036214653,0.0004694694,0.0005132706,0.00077781954,0.0007622525,0.0004778172,0.00025280012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013266961,0.000043431155,0.0013866625,0.00011754639,0.000042923406,0.00029235551,0.000193341,0.8544175,0.020246845,0.041923527,0.0011895779,0.080013566],"study_design_scores_gemma":[0.000005214457,0.0000499996,0.0001666523,0.0000071725317,0.000006334109,0.000092087685,0.000026104055,0.9918256,0.0023673668,0.0045552775,0.00088868634,0.000009496281],"about_ca_topic_score_codex":0.0023035398,"about_ca_topic_score_gemma":0.0024832154,"teacher_disagreement_score":0.0023035398,"about_ca_system_score_codex":0.00046060875,"about_ca_system_score_gemma":0.0006994488,"threshold_uncertainty_score":0.0045802593},"labels":[],"label_agreement":null},{"id":"W4387969990","doi":"10.1109/jsac.2023.3313016","title":"Guest Editorial Digital Twins for Mobile Networks—Part I","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Digital Transformation in Industry","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 Ottawa; Polytechnique Montréal","funders":"","keywords":"Computer science; Virtual world; Analytics; Set (abstract data type); Data science; Representation (politics); Mobile computing; Artificial intelligence; Human–computer interaction; Multimedia; Telecommunications","score_opus":0.023532952763988337,"score_gpt":0.2847268872561867,"score_spread":0.2611939344921984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387969990","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003551723,0.0040605664,0.00012854712,0.023244392,0.9692049,0.000027144648,0.00004051188,0.000055860513,0.0032025664],"genre_scores_gemma":[0.00037901071,0.0044299373,0.00008007039,0.014759545,0.9679321,0.000027070922,0.000025407891,0.000035136334,0.0123317195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997223,0.00033449594,0.0002786887,0.00037385785,0.0015461737,0.00024389882],"domain_scores_gemma":[0.9910398,0.0028792957,0.0006180721,0.00029091656,0.0033068303,0.0018649147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004007304,0.0027840424,0.0021712903,0.0023505376,0.0026972394,0.009141791,0.0026065523,0.0138972355,0.028693885],"category_scores_gemma":[0.0137388315,0.00082020444,0.0017464153,0.0010969259,0.0019901907,0.0051709753,0.0017726963,0.017901594,0.024160791],"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.000028147682,0.000014498418,0.000017853574,0.00018011946,0.0000073087513,0.000118060365,0.000008219034,0.00002593593,0.0000774213,0.0006164867,0.9921583,0.006747817],"study_design_scores_gemma":[0.000027079326,0.000023435043,0.00009794783,0.00024447608,0.000013713243,0.00017939755,0.0000215114,0.000084433974,0.00009711148,0.000800139,0.99840087,0.000009785573],"about_ca_topic_score_codex":0.0006478658,"about_ca_topic_score_gemma":0.0014890417,"teacher_disagreement_score":0.028693885,"about_ca_system_score_codex":0.0019693521,"about_ca_system_score_gemma":0.0019433837,"threshold_uncertainty_score":0.0959906},"labels":[],"label_agreement":null},{"id":"W4388208328","doi":"10.1109/jsac.2023.3313017","title":"Guest Editorial Digital Twins for Mobile Networks—Part II","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","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 Ottawa; Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.02528842694597396,"score_gpt":0.3060338564320771,"score_spread":0.28074542948610315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388208328","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004361883,0.003922914,0.00014703174,0.016043406,0.97639585,0.000023718134,0.0000426683,0.000058436068,0.0033224532],"genre_scores_gemma":[0.00044178884,0.0043270136,0.000084945415,0.0099846525,0.9725973,0.0000241637,0.000030511683,0.000034655608,0.01247486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975212,0.00022445936,0.000240627,0.00036979027,0.0014291629,0.00021468943],"domain_scores_gemma":[0.9905895,0.0025818134,0.0005702784,0.000299636,0.0037549816,0.002203883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033952405,0.002468267,0.0021864136,0.0026583907,0.0024932816,0.008704268,0.002323231,0.009987427,0.026831137],"category_scores_gemma":[0.012530717,0.00074121833,0.0016579705,0.0011412199,0.0018346974,0.0045208847,0.0014932461,0.01455726,0.023169551],"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.000028580736,0.000015661892,0.00002433563,0.00019203202,0.000007532488,0.00014958948,0.000009199709,0.00003587153,0.00011521773,0.000571988,0.9906669,0.008183152],"study_design_scores_gemma":[0.000023319777,0.00002437793,0.00012879283,0.00022173308,0.000013867982,0.0002896855,0.000021187732,0.00011977333,0.00013428798,0.00069632014,0.99831593,0.000010700282],"about_ca_topic_score_codex":0.00068039965,"about_ca_topic_score_gemma":0.0014448713,"teacher_disagreement_score":0.026831137,"about_ca_system_score_codex":0.0018203581,"about_ca_system_score_gemma":0.001985081,"threshold_uncertainty_score":0.08975911},"labels":[],"label_agreement":null},{"id":"W4389104731","doi":"10.1109/jsac.2023.3336191","title":"Safe and Accelerated Deep Reinforcement Learning-Based O-RAN Slicing: A Hybrid Transfer Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Energy Harvesting in Wireless Networks","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":"University of Calgary; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Radio access network; Transfer of learning; Software deployment; Ran; Slicing; Reuse; Distributed computing; Artificial intelligence; Machine learning; Computer network; Software engineering; World Wide Web","score_opus":0.03479004449132257,"score_gpt":0.25823152373448477,"score_spread":0.2234414792431622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389104731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041379385,0.00030878233,0.95234424,0.00028184455,0.00005500507,0.00006321681,0.000032963613,0.0025205768,0.003014123],"genre_scores_gemma":[0.91255224,0.000091728376,0.08467223,0.00024501805,0.00003114556,0.000071732575,0.00007952978,0.00012687063,0.0021296116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994399,0.0001399316,0.000024184412,0.00014571358,0.00011699587,0.00013322145],"domain_scores_gemma":[0.9986639,0.00059969275,0.00016524989,0.0001908545,0.0002547022,0.00012563712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012158105,0.00095376075,0.00078258367,0.00031105443,0.00031578777,0.0007131256,0.0017613793,0.00090559624,0.0021328744],"category_scores_gemma":[0.0032976025,0.00037058684,0.000408284,0.0002380959,0.0010838872,0.0012896267,0.0013162964,0.0019632753,0.0005371832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015316522,0.00014133366,0.0010927967,0.00005117165,0.0000335492,0.000084421714,0.00008899803,0.87660223,0.0048748744,0.0038801946,0.0011804849,0.11181685],"study_design_scores_gemma":[0.0000052134897,0.000022234453,0.000044667293,0.000002281703,0.0000023607802,0.000005640046,0.00000451797,0.99829227,0.00074801175,0.0007439567,0.00012606675,0.000002659597],"about_ca_topic_score_codex":0.006534447,"about_ca_topic_score_gemma":0.005249757,"teacher_disagreement_score":0.006534447,"about_ca_system_score_codex":0.00088382367,"about_ca_system_score_gemma":0.0017675245,"threshold_uncertainty_score":0.012992859},"labels":[],"label_agreement":null},{"id":"W4389104915","doi":"10.1109/jsac.2023.3334610","title":"Empowering the 6G Cellular Architecture With Open RAN","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":91,"is_retracted":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":"Bundesministerium für Bildung und Forschung; National Science Foundation","keywords":"Ran; Computer science; Orchestration; Cellular network; Telecommunications; Modular design; Architecture; Standardization; Pace; Data science; Computer network","score_opus":0.02472272660466027,"score_gpt":0.2930426802013583,"score_spread":0.268319953596698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389104915","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.037812095,0.0019343048,0.8359406,0.0048204795,0.0005675156,0.000093941424,0.000056812212,0.0012158616,0.1175584],"genre_scores_gemma":[0.69777995,0.004056789,0.26542082,0.0015750721,0.0011771335,0.0001532799,0.00014805947,0.00020084628,0.02948801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879056,0.00037749967,0.00004134511,0.0001362266,0.00046840293,0.00018598569],"domain_scores_gemma":[0.9993099,0.00014283795,0.00005905978,0.00020085447,0.00017948556,0.00010784731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116136,0.00045190126,0.00019598578,0.00038078212,0.0009167114,0.0040150327,0.0008310244,0.0015132049,0.0028618767],"category_scores_gemma":[0.0015297803,0.000280862,0.000323258,0.0003623316,0.0016843324,0.0045701666,0.003599486,0.0026503822,0.001278156],"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.00006186764,0.000054940796,0.00079907675,0.000072774805,0.000013673876,0.00027720752,0.0007509248,0.017271321,0.01431113,0.86558336,0.0040204884,0.09678335],"study_design_scores_gemma":[0.000025574898,0.000170909,0.0009959785,0.00012847026,0.000034240267,0.0005878223,0.0005584178,0.11182973,0.0074340133,0.49525604,0.3829124,0.00006651114],"about_ca_topic_score_codex":0.0014464676,"about_ca_topic_score_gemma":0.0016799411,"teacher_disagreement_score":0.0040150327,"about_ca_system_score_codex":0.0008180731,"about_ca_system_score_gemma":0.000947941,"threshold_uncertainty_score":0.009573996},"labels":[],"label_agreement":null},{"id":"W4389104987","doi":"10.1109/jsac.2023.3336156","title":"Flexible RAN Slicing in Open RAN With Constrained Multi-Agent Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Reinforcement learning; Computer science; Distributed computing; Leverage (statistics); Provisioning; Exploit; Software deployment; Slicing; Computer network; Artificial intelligence; Computer security; World Wide Web; Software engineering","score_opus":0.07500392290630888,"score_gpt":0.3300656627497989,"score_spread":0.25506173984349007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389104987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057828195,0.00020575144,0.9388966,0.0001677044,0.000041345396,0.000051108484,0.00002815349,0.0004614238,0.002319706],"genre_scores_gemma":[0.94419384,0.00006525385,0.05433307,0.000102818034,0.000017427326,0.00006468396,0.000044552256,0.000034451816,0.0011439407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995752,0.00013169776,0.000019336625,0.00011141062,0.00007183619,0.00009059131],"domain_scores_gemma":[0.9982759,0.0010274136,0.00024712677,0.000121905345,0.00019639009,0.00013129546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010652879,0.0007095541,0.0007813921,0.00024068853,0.00033776055,0.0006568387,0.0010738135,0.00073320384,0.001115018],"category_scores_gemma":[0.0032264013,0.00038384652,0.0003658848,0.00017653157,0.00088836346,0.00083545956,0.00097139704,0.0011531888,0.00017219121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044758617,0.000030444466,0.0005042623,0.000019062945,0.000015395537,0.00005340399,0.000032357162,0.98366725,0.0011192035,0.0019899444,0.00023882704,0.012285166],"study_design_scores_gemma":[0.000003949863,0.000012882968,0.000036547637,0.0000014729047,0.0000020597736,0.0000042821953,0.0000030431147,0.99911934,0.00014214274,0.00060077466,0.000071962066,0.0000016322144],"about_ca_topic_score_codex":0.005864307,"about_ca_topic_score_gemma":0.0058580944,"teacher_disagreement_score":0.005864307,"about_ca_system_score_codex":0.0005736052,"about_ca_system_score_gemma":0.0010413919,"threshold_uncertainty_score":0.011660337},"labels":[],"label_agreement":null},{"id":"W4389164829","doi":"10.1109/jsac.2023.3322051","title":"Guest Editorial Special Issue on 5G/6G Precise Positioning on Cooperative Intelligent Transportation Systems (C-ITS) and Connected Automated Vehicles (CAV)–Part I","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","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":"National Institute of Informatics","keywords":"Computer science; Reliability (semiconductor); Robotics; Intelligent transportation system; Systems engineering; Telecommunications; Artificial intelligence; Robot; Power (physics); Transport engineering; Engineering","score_opus":0.02582361672225706,"score_gpt":0.3059619034261994,"score_spread":0.2801382867039423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389164829","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004949289,0.0029227245,0.00013298713,0.012553734,0.98184156,0.000019341773,0.000045823577,0.000052551623,0.002381778],"genre_scores_gemma":[0.00037264221,0.00313097,0.0000711672,0.006568518,0.9805549,0.000015322008,0.000040435654,0.00003716775,0.0092087975],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767905,0.0002546467,0.00024621235,0.00036093275,0.0012362053,0.0002229727],"domain_scores_gemma":[0.99075985,0.0021171963,0.00062252046,0.00024954224,0.004319544,0.0019313147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032598656,0.0025426645,0.0028982798,0.0025509077,0.0022642608,0.006572433,0.0022362883,0.008352354,0.023273285],"category_scores_gemma":[0.008601175,0.0007713116,0.00201615,0.0011802983,0.0014629199,0.0033678976,0.0012558504,0.011481838,0.018941073],"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.000040672065,0.000015219708,0.000033425054,0.00020268575,0.000012298079,0.00013652095,0.000008149383,0.000032890155,0.00014518268,0.0003154898,0.99251235,0.0065450827],"study_design_scores_gemma":[0.00003945221,0.00003951374,0.0002927452,0.00023801239,0.00003616015,0.00032353232,0.000027507904,0.00017423458,0.00020459662,0.00070247485,0.99790657,0.00001535221],"about_ca_topic_score_codex":0.0007564451,"about_ca_topic_score_gemma":0.0022354056,"teacher_disagreement_score":0.023273285,"about_ca_system_score_codex":0.001823242,"about_ca_system_score_gemma":0.0019190484,"threshold_uncertainty_score":0.0778569},"labels":[],"label_agreement":null},{"id":"W4389898553","doi":"10.1109/jsac.2023.3322070","title":"Guest Editorial Special Issue on 5G/6G Precise Positioning on Cooperative Intelligent Transportation Systems (C-ITS) and Connected Automated Vehicles (CAV)—Part II","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Transportation and Mobility Innovations","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 Waterloo","funders":"","keywords":"Computer science; Intelligent transportation system; Telecommunications; Systems engineering; Engineering management; Transport engineering; Engineering","score_opus":0.02025991325077089,"score_gpt":0.28911412887955545,"score_spread":0.2688542156287846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389898553","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006509094,0.002547534,0.0001801244,0.010055874,0.9840605,0.000015483383,0.000052654672,0.000052953998,0.002969813],"genre_scores_gemma":[0.0006217028,0.0028547414,0.00009361188,0.004071765,0.97930473,0.000012804376,0.000045316214,0.00004936628,0.012945943],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794847,0.00025449696,0.00024403134,0.00031690032,0.0010657544,0.00017033046],"domain_scores_gemma":[0.99054366,0.001978854,0.00056797103,0.00025036995,0.0051703355,0.0014888365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026727938,0.0020086172,0.0019194813,0.0024058623,0.0016320694,0.005053612,0.0014459898,0.0046693357,0.02852157],"category_scores_gemma":[0.008867524,0.0004805333,0.001290319,0.00091754855,0.0009576374,0.002447875,0.0008890929,0.0069837375,0.017438572],"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.000041741776,0.000011005473,0.000031362346,0.00018999753,0.000008882178,0.00012101675,0.000009615911,0.0000315935,0.00015591673,0.00043372865,0.99160236,0.0073628607],"study_design_scores_gemma":[0.000027420703,0.000038670274,0.0002266847,0.00020215569,0.000025121362,0.00033029678,0.00003336499,0.00017010768,0.00026975086,0.000797902,0.9978672,0.000011317018],"about_ca_topic_score_codex":0.00043224418,"about_ca_topic_score_gemma":0.0011080798,"teacher_disagreement_score":0.02852157,"about_ca_system_score_codex":0.0012747148,"about_ca_system_score_gemma":0.0016826927,"threshold_uncertainty_score":0.09541416},"labels":[],"label_agreement":null},{"id":"W4390044321","doi":"10.1109/jsac.2023.3345420","title":"Counterfactual Quantum Byzantine Consensus for Human-Centric Metaverse","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Memorial University of Newfoundland","funders":"Institute for Information and Communications Technology Promotion; National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Queen's University; National Research Foundation; Queen's University Belfast; Royal Academy of Engineering","keywords":"Computer science; Byzantine fault tolerance; Counterfactual thinking; Robustness (evolution); Distributed computing; Scalability; Computer network; Fault tolerance","score_opus":0.05498757382258725,"score_gpt":0.328129737659432,"score_spread":0.27314216383684475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390044321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092706725,0.00016047056,0.90065306,0.0005924004,0.0000942153,0.00009759587,0.00003556019,0.00024201673,0.005418],"genre_scores_gemma":[0.9382201,0.000102502076,0.059813857,0.00009298415,0.000027144577,0.00011836097,0.00003408406,0.000030924726,0.0015600417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977556,0.0010693573,0.00008091528,0.00033061026,0.0005874674,0.00017617132],"domain_scores_gemma":[0.99379706,0.003192458,0.0006713784,0.0014538661,0.0005828015,0.00030254555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038182375,0.000324898,0.00061918236,0.00045122908,0.0012456434,0.0015031699,0.0011656344,0.0015019673,0.0025523773],"category_scores_gemma":[0.010268936,0.00022524467,0.00048526522,0.00044880004,0.0032960137,0.0033293937,0.002704729,0.0013896053,0.00025597322],"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.00024909686,0.000053266263,0.00065269385,0.00009411254,0.000037702088,0.00031337028,0.00043321296,0.20197332,0.010579713,0.7714793,0.0006448775,0.0134893],"study_design_scores_gemma":[0.000034099652,0.00007424773,0.00010574369,0.000014359439,0.000011262999,0.00006117397,0.00005134105,0.81429714,0.005133503,0.17837957,0.0018136486,0.000023863491],"about_ca_topic_score_codex":0.0009890542,"about_ca_topic_score_gemma":0.00078554015,"teacher_disagreement_score":0.0038182375,"about_ca_system_score_codex":0.0013078469,"about_ca_system_score_gemma":0.0016279334,"threshold_uncertainty_score":0.02019304},"labels":[],"label_agreement":null},{"id":"W4390044325","doi":"10.1109/jsac.2023.3345402","title":"Semantic Information Marketing in the Metaverse: A Learning-Based Contract Theory Framework","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Crowdsensing and Crowdsourcing","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":"University of Waterloo","funders":"National Research Foundation Singapore","keywords":"Computer science; Incentive; Private information retrieval; Contract theory; Profit (economics); Incentive compatibility; Adverse selection; Computer security","score_opus":0.020872645660621105,"score_gpt":0.2814715017255548,"score_spread":0.2605988560649337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390044325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017741978,0.00036409465,0.9679769,0.0017272754,0.000085106025,0.0001632664,0.00006546061,0.00012908343,0.01174684],"genre_scores_gemma":[0.7937126,0.0005933629,0.19513464,0.000453202,0.00018234916,0.00045915242,0.0000805984,0.00008128673,0.009302791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942583,0.0033066752,0.00019403276,0.0008014381,0.0009909577,0.00044862082],"domain_scores_gemma":[0.98939055,0.0067465254,0.0010946139,0.0010749707,0.00085723173,0.00083607016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007998162,0.0009837112,0.0016388297,0.0013009915,0.0017759282,0.004273827,0.0034244969,0.0041159997,0.007234106],"category_scores_gemma":[0.01694213,0.00073719805,0.0013800793,0.001488318,0.004870707,0.0089937635,0.0038063761,0.0038812454,0.0006625768],"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.00008895295,0.00015860224,0.000640039,0.00013061726,0.000059385045,0.00016056687,0.00030669253,0.19922665,0.00075846346,0.76861995,0.0015724048,0.028277779],"study_design_scores_gemma":[0.00003420531,0.00005804486,0.00011230518,0.000028661629,0.000013724459,0.00005898959,0.000071706134,0.6576782,0.00029347322,0.33852318,0.0031048814,0.000022653006],"about_ca_topic_score_codex":0.0019971395,"about_ca_topic_score_gemma":0.0014209423,"teacher_disagreement_score":0.007998162,"about_ca_system_score_codex":0.0037297192,"about_ca_system_score_gemma":0.0037373798,"threshold_uncertainty_score":0.042298853},"labels":[],"label_agreement":null},{"id":"W4390075088","doi":"10.1109/jsac.2023.3345422","title":"Collaborative and Verifiable VNF Management for Metaverse With Efficient Modular Designs","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Huawei Technologies (Canada); University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Modular design; Metaverse; Quality of service; Distributed computing; Interoperability; Service (business); Verifiable secret sharing; Testbed; Computer network; Human–computer interaction; World Wide Web; Operating system; Virtual reality","score_opus":0.0332253612252593,"score_gpt":0.283208237722783,"score_spread":0.24998287649752368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15983939,0.0003995672,0.8321461,0.00031125048,0.0000743926,0.0002605641,0.000112242844,0.0018158769,0.0050407387],"genre_scores_gemma":[0.9230803,0.00009898473,0.074799374,0.00006436755,0.000023554046,0.000107887296,0.00013265481,0.0000478173,0.0016450741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881196,0.00026077326,0.00008207481,0.0002051572,0.0004332639,0.00020677474],"domain_scores_gemma":[0.99768186,0.000473536,0.00030678196,0.0010916144,0.00029063155,0.00015553345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948512,0.0004756797,0.00046952066,0.0006220876,0.00088646647,0.0012617783,0.0017490775,0.0007344445,0.0027767362],"category_scores_gemma":[0.0025889087,0.00022504826,0.00038544156,0.00048963237,0.0010966846,0.0032478771,0.0020922776,0.00077137,0.00043057947],"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.001481216,0.00042618153,0.007586314,0.00041631935,0.00014080631,0.0010036249,0.001052681,0.26466048,0.16465968,0.1804333,0.0049863816,0.37315306],"study_design_scores_gemma":[0.000087353736,0.00042324033,0.0006271931,0.0000366685,0.000043104563,0.00031459748,0.00010199974,0.9024466,0.04538356,0.04063353,0.009854762,0.00004733979],"about_ca_topic_score_codex":0.0013917589,"about_ca_topic_score_gemma":0.0016641159,"teacher_disagreement_score":0.0027767362,"about_ca_system_score_codex":0.0011449847,"about_ca_system_score_gemma":0.0013981202,"threshold_uncertainty_score":0.0092891455},"labels":[],"label_agreement":null},{"id":"W4390075313","doi":"10.1109/jsac.2023.3345391","title":"Practical Network Modeling Using Weak Supervision Signals for Human-Centric Networking in Metaverse","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"Huawei Technologies; National Natural Science Foundation of China","keywords":"Computer science; Bottleneck; Queueing theory; Generalization; Artificial neural network; Machine learning; Distributed computing; Network simulation; Artificial intelligence; Computer network","score_opus":0.2746810900907732,"score_gpt":0.4485988313767286,"score_spread":0.17391774128595544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04397327,0.00009097033,0.95367116,0.00027421612,0.000021546006,0.00002373001,0.00005878524,0.00035343808,0.0015328452],"genre_scores_gemma":[0.913433,0.00018541231,0.083651535,0.0000898421,0.00003220751,0.00008206048,0.00017029178,0.00007361271,0.0022819864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995307,0.00018203331,0.000016705184,0.00012826419,0.00009083764,0.000051610055],"domain_scores_gemma":[0.99854493,0.00077662204,0.00016532825,0.00018302037,0.0002432359,0.00008693529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014117218,0.0006686501,0.00063145434,0.0005709648,0.0005966443,0.0010587828,0.0014786907,0.0011662523,0.0014910372],"category_scores_gemma":[0.0040136124,0.0004049813,0.00059626374,0.0004705018,0.0011197932,0.0021269822,0.0013029887,0.001634521,0.00025203289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003599992,0.000027526625,0.00071711006,0.000013956188,0.000006847927,0.0000436683,0.000046630383,0.9789417,0.0007559297,0.01078131,0.00027547413,0.008353813],"study_design_scores_gemma":[5.1427094e-7,0.000002603142,0.00002657591,6.555163e-7,4.5355392e-7,0.0000020704417,0.0000021644616,0.99789846,0.00008370464,0.0019405952,0.00004139478,8.37937e-7],"about_ca_topic_score_codex":0.009860135,"about_ca_topic_score_gemma":0.0089044,"teacher_disagreement_score":0.009860135,"about_ca_system_score_codex":0.0016343459,"about_ca_system_score_gemma":0.0012852461,"threshold_uncertainty_score":0.019605458},"labels":[],"label_agreement":null},{"id":"W4390187312","doi":"10.1109/jsac.2023.3345381","title":"HeadTrack: Real-Time Human–Computer Interaction via Wireless Earphones","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","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":"Simon Fraser University","funders":"National Key Research and Development Program of China; Shenzhen Science and Technology Innovation Program; Key Research and Development Program of Hunan Province of China; Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Telecommunications","score_opus":0.054790490615987175,"score_gpt":0.3309793096014351,"score_spread":0.27618881898544795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390187312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051492628,0.0020398144,0.9168585,0.00029367598,0.00046547322,0.00035937832,0.0007101915,0.014763963,0.0130163245],"genre_scores_gemma":[0.7045271,0.0026113084,0.25842953,0.0012734125,0.0005999088,0.0007816686,0.0013386011,0.00083678286,0.029601673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994618,0.00007895225,0.000028364404,0.000105809115,0.0002722727,0.000052865995],"domain_scores_gemma":[0.99970454,0.000091120346,0.000037495207,0.000042815765,0.00009902827,0.000024951147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003659497,0.0006069697,0.00036128942,0.00050923927,0.0001684329,0.000667297,0.0007757015,0.0007988418,0.008326308],"category_scores_gemma":[0.00094830134,0.00022118133,0.00023197399,0.00040434077,0.00022856377,0.0011465701,0.0011640582,0.00031576818,0.0027893547],"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.00085018354,0.00016522934,0.0031638981,0.00064381806,0.00013023932,0.00064038247,0.00047978005,0.004804122,0.3725971,0.0032025764,0.02751162,0.5858111],"study_design_scores_gemma":[0.00054733525,0.0036508602,0.030221697,0.00024864278,0.00047911654,0.006002652,0.00047687517,0.23552524,0.43489543,0.0052473308,0.2822556,0.0004492384],"about_ca_topic_score_codex":0.0007438641,"about_ca_topic_score_gemma":0.0008858872,"teacher_disagreement_score":0.008326308,"about_ca_system_score_codex":0.000158921,"about_ca_system_score_gemma":0.00025879135,"threshold_uncertainty_score":0.027854323},"labels":[],"label_agreement":null},{"id":"W4390481005","doi":"10.1109/jsac.2023.3345385","title":"MLOps in the Metaverse: Human-Centric Continuous Integration","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Neural Network Applications","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":"Computer science; Metaverse; Human–computer interaction; Artificial intelligence; Virtual machine; Field (mathematics); Virtual reality; Machine learning; Programming language","score_opus":0.044867566702838375,"score_gpt":0.3355270953609135,"score_spread":0.29065952865807515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390481005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07930236,0.00030317908,0.9054154,0.00091195706,0.00010417231,0.00016875778,0.00010084236,0.0088602975,0.004833016],"genre_scores_gemma":[0.7194078,0.0002276302,0.2734581,0.00055028434,0.00009512015,0.0002633874,0.0004566754,0.001348746,0.0041923076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944469,0.0020878576,0.00030416722,0.0012062385,0.0014807247,0.00047404633],"domain_scores_gemma":[0.9870028,0.003850412,0.0008372936,0.0059996704,0.0011090445,0.0012007485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007629989,0.0011858688,0.0010286248,0.00084496563,0.0010312559,0.0061608935,0.004198225,0.002099758,0.0037717097],"category_scores_gemma":[0.0153514175,0.0009915621,0.0008737385,0.00090359745,0.0035814694,0.012649962,0.011522288,0.002919462,0.0013072847],"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.0028469271,0.0021783125,0.024327565,0.00049740484,0.0004670138,0.0014332345,0.009146394,0.2619938,0.048764326,0.103493005,0.011669952,0.5331821],"study_design_scores_gemma":[0.00013419728,0.0010169675,0.0029582053,0.00009351681,0.00009070393,0.0003611659,0.0011558053,0.83312607,0.023329457,0.11006699,0.027554134,0.00011272752],"about_ca_topic_score_codex":0.0019488549,"about_ca_topic_score_gemma":0.0016409211,"teacher_disagreement_score":0.007629989,"about_ca_system_score_codex":0.0010482395,"about_ca_system_score_gemma":0.0017925211,"threshold_uncertainty_score":0.04035175},"labels":[],"label_agreement":null},{"id":"W4390905677","doi":"10.1109/jsac.2023.3334605","title":"Guest Editorial Open RAN: A New Paradigm for Open, Virtualized, Programmable, and Intelligent Cellular Networks","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in 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":"University of Ottawa","funders":"","keywords":"Ran; Computer science; C-RAN; Automation; Intelligent Network; Open architecture; Architecture; Computer network; Radio access network; Operating system; Base station; Engineering","score_opus":0.027928187274314037,"score_gpt":0.320020775224064,"score_spread":0.29209258794975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390905677","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051459934,0.0038387885,0.00029482512,0.023530662,0.96891934,0.000017524917,0.000041961022,0.00005520366,0.0032502522],"genre_scores_gemma":[0.00044457914,0.0026841268,0.00008911205,0.006119138,0.98128223,0.000011404721,0.000016807811,0.000027967335,0.009324731],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970914,0.00029895097,0.00025217352,0.00035770232,0.0017947258,0.00020503868],"domain_scores_gemma":[0.9894582,0.003541323,0.00062587875,0.0002906213,0.0044732927,0.0016107126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035074994,0.0023668073,0.0020143662,0.00205186,0.001969668,0.006486628,0.0019730737,0.008504538,0.015865048],"category_scores_gemma":[0.011899106,0.0006141145,0.0013069509,0.0008148518,0.0019273178,0.0034111592,0.0010981926,0.013234568,0.013756888],"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.000028308188,0.00001240363,0.000017852337,0.00015646311,0.000006943733,0.00014202569,0.00001053493,0.00004438104,0.000092267735,0.0008237678,0.9926375,0.006027446],"study_design_scores_gemma":[0.000024436395,0.000024435973,0.00009089566,0.00019077775,0.000014218173,0.00027006285,0.000025457419,0.00016214924,0.0001455122,0.0012856502,0.997755,0.000011453216],"about_ca_topic_score_codex":0.00048074586,"about_ca_topic_score_gemma":0.0012281073,"teacher_disagreement_score":0.015865048,"about_ca_system_score_codex":0.0013911149,"about_ca_system_score_gemma":0.0015893058,"threshold_uncertainty_score":0.053073883},"labels":[],"label_agreement":null},{"id":"W4392172639","doi":"10.1109/jsac.2024.3365886","title":"Semantically-Disentangled Progressive Image Compression for Deep Space Communications: Exploring the Ultra-low Rate Regime","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Western University","funders":"Xiamen Southern Oceanographic Center; National Natural Science Foundation of China","keywords":"Computer science; Image compression; Data compression; Space (punctuation); Artificial intelligence; Computer vision; Image (mathematics); Image processing","score_opus":0.05587107475160344,"score_gpt":0.3515099658920929,"score_spread":0.29563889114048947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744319,0.0017518727,0.91547406,0.0006909931,0.00010459278,0.00006185586,0.00020902212,0.00071007264,0.0065655457],"genre_scores_gemma":[0.7851345,0.0018333431,0.20627846,0.00049589656,0.000106796804,0.00009259829,0.00053716655,0.00020434367,0.0053168717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974924,0.00004459095,0.000010556187,0.000038673516,0.00012807806,0.00002879557],"domain_scores_gemma":[0.9993444,0.00029223325,0.00006676695,0.000142075,0.00011974246,0.000034770987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059358,0.00062528084,0.00035639582,0.0004022771,0.00021376135,0.0007574438,0.0005639263,0.00049146294,0.0015086153],"category_scores_gemma":[0.0021838704,0.0001307562,0.00025198748,0.00045889322,0.0006876054,0.0015033617,0.0009595777,0.0015496432,0.00040912905],"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.00061273726,0.0002079762,0.0026004678,0.000318398,0.000085532454,0.00052568654,0.00029240618,0.3518259,0.14365782,0.06681162,0.0066792765,0.42638218],"study_design_scores_gemma":[0.000016787379,0.0001427424,0.0006291291,0.000035959,0.000018074941,0.00028794087,0.000050000654,0.9309728,0.0454488,0.017461054,0.0049137403,0.000023020237],"about_ca_topic_score_codex":0.00089790084,"about_ca_topic_score_gemma":0.0017696781,"teacher_disagreement_score":0.0015086153,"about_ca_system_score_codex":0.00034880856,"about_ca_system_score_gemma":0.00039683346,"threshold_uncertainty_score":0.0050468445},"labels":[],"label_agreement":null},{"id":"W4392282868","doi":"10.1109/jsac.2023.3344091","title":"Guest Editorial Human-Centric Communication and Networking for Metaverse Over 5G and Beyond Networks—Part I","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Robotics and Automated 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 Victoria","funders":"Nanjing Institute of Technology; University of Michigan; Purdue University","keywords":"Computer science; Metaverse; Human–computer interaction; Data science; Computer network; Virtual reality","score_opus":0.016853248111231383,"score_gpt":0.2815675312163626,"score_spread":0.2647142831051312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392282868","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054510405,0.0036494685,0.00022700586,0.024040261,0.968094,0.000026772184,0.000043043132,0.00006654277,0.00379842],"genre_scores_gemma":[0.0005352858,0.0036063497,0.00009297674,0.009213187,0.97522384,0.000023684628,0.00002366785,0.000030292145,0.011250788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976636,0.00026649862,0.0002113597,0.00037154136,0.0012561539,0.00023081047],"domain_scores_gemma":[0.9911294,0.0032224641,0.0005146942,0.00025493838,0.003283802,0.0015947402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032848374,0.0024336143,0.002059644,0.0020511923,0.0027621447,0.007255908,0.002271385,0.013409519,0.018801391],"category_scores_gemma":[0.010083525,0.0007110653,0.001646103,0.0010039433,0.002071919,0.0036054887,0.0012985768,0.015663223,0.013015755],"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.000027599328,0.000014384189,0.000023096372,0.00016717224,0.000008967533,0.00017064103,0.000010655426,0.00004557465,0.00011447822,0.0008071466,0.99161327,0.006997106],"study_design_scores_gemma":[0.000024578563,0.000041060746,0.00017614265,0.00026608902,0.000020844882,0.00025167203,0.000027016164,0.00018124127,0.00014566159,0.0009959333,0.9978549,0.000014836879],"about_ca_topic_score_codex":0.0007718399,"about_ca_topic_score_gemma":0.0018293973,"teacher_disagreement_score":0.018801391,"about_ca_system_score_codex":0.0020726388,"about_ca_system_score_gemma":0.0016324213,"threshold_uncertainty_score":0.06289691},"labels":[],"label_agreement":null},{"id":"W4392904767","doi":"10.1109/jsac.2024.3365878","title":"Stigmergy and Hierarchical Learning for Routing Optimization in Multi-Domain Collaborative Satellite Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite Communication Systems","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":"Carleton University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Stigmergy; Computer network; Hierarchical routing; Routing (electronic design automation); Distributed computing; Communications satellite; Collaborative learning; Domain (mathematical analysis); Satellite; Routing protocol; Static routing; Knowledge management","score_opus":0.03301160809990295,"score_gpt":0.3013068056940218,"score_spread":0.26829519759411885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392904767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046106566,0.0002265739,0.95095587,0.00023254231,0.00002546471,0.000028219516,0.000017849363,0.00021243645,0.0021945045],"genre_scores_gemma":[0.94416535,0.00011066636,0.054109417,0.000066866465,0.000017568036,0.000054962584,0.000031955544,0.000020391604,0.0014227362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997986,0.00006631313,0.000009790939,0.000047810543,0.000041516934,0.000036040656],"domain_scores_gemma":[0.99941814,0.0003350328,0.00009086995,0.000046100344,0.000062677274,0.000047129495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064310833,0.00045552646,0.00059039664,0.00037076318,0.00040686718,0.0005140716,0.0009321416,0.0006309842,0.0009356082],"category_scores_gemma":[0.0018021676,0.0002538854,0.00034766385,0.00034421647,0.00077360676,0.000834283,0.000911289,0.00070942193,0.00011336337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001246737,0.000011901303,0.00019094111,0.000008947698,0.000007298679,0.000011633096,0.000016857302,0.9878228,0.0003235324,0.003615185,0.00015091857,0.0078275],"study_design_scores_gemma":[0.0000017700264,0.000005090814,0.000019369329,5.2156884e-7,9.188874e-7,0.0000015165358,0.000001647398,0.99865854,0.000049016955,0.0012193492,0.000041468094,8.001168e-7],"about_ca_topic_score_codex":0.0065499423,"about_ca_topic_score_gemma":0.006207455,"teacher_disagreement_score":0.0065499423,"about_ca_system_score_codex":0.0008455645,"about_ca_system_score_gemma":0.00092391536,"threshold_uncertainty_score":0.0130236745},"labels":[],"label_agreement":null},{"id":"W4393079426","doi":"10.1109/jsac.2024.3380102","title":"Security of Coherent-State Quantum Key Distribution Using Displacement Receiver","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Quantum Information and Cryptography","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":"Quantum key distribution; Computer science; Key (lock); Coherent states; State (computer science); Quantum cryptography; Telecommunications; Computer network; Electronic engineering; Quantum; Computer security; Quantum information; Algorithm; Quantum mechanics; Physics","score_opus":0.029439411267983665,"score_gpt":0.30640590006936513,"score_spread":0.27696648880138147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393079426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.336796,0.0006015314,0.6530812,0.00063614047,0.000050527156,0.000059746217,0.00006410255,0.00017345812,0.008537374],"genre_scores_gemma":[0.9834869,0.0001538424,0.015605521,0.00004565271,0.000009464022,0.000023467795,0.000018066185,0.000008258753,0.00064881594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989636,0.00035211229,0.00003969352,0.0001624564,0.00035223656,0.00012986748],"domain_scores_gemma":[0.99918526,0.0003849104,0.00014045596,0.00015900603,0.00010693613,0.000023441067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013060762,0.00043319707,0.00051276374,0.00020336453,0.00042364598,0.0008231853,0.00073884806,0.0010023863,0.00088517164],"category_scores_gemma":[0.0022082825,0.00023629007,0.00031068633,0.0003318109,0.0012317318,0.001864424,0.0013511743,0.0005624536,0.00017583056],"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.00063403085,0.000117809046,0.0042334762,0.0003856764,0.00008576261,0.00036813715,0.0002729174,0.28481817,0.23338276,0.43628496,0.0008253473,0.03859094],"study_design_scores_gemma":[0.00007764635,0.00021006202,0.00041759468,0.000020733702,0.000027692735,0.00013370576,0.000031948977,0.931632,0.043150924,0.023156293,0.001105981,0.0000354713],"about_ca_topic_score_codex":0.00047392026,"about_ca_topic_score_gemma":0.0003109901,"teacher_disagreement_score":0.0013060762,"about_ca_system_score_codex":0.00077122747,"about_ca_system_score_gemma":0.0009789995,"threshold_uncertainty_score":0.0069072247},"labels":[],"label_agreement":null},{"id":"W4399602013","doi":"10.1109/jsac.2024.3413973","title":"Maximizing the Value of Service Provisioning in Multi-User ISAC Systems Through Fairness Guaranteed Collaborative Resource Allocation","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"IoT and Edge/Fog Computing","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Provisioning; Resource allocation; Computer network; Resource management (computing); Max-min fairness; Service (business); Quality of service; Distributed computing; Business","score_opus":0.04461792930972024,"score_gpt":0.31846220050942875,"score_spread":0.2738442711997085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08126696,0.00046591533,0.91287905,0.00027776483,0.000059002537,0.000077826924,0.000029839499,0.00015969946,0.004784012],"genre_scores_gemma":[0.97170895,0.00011808468,0.027370732,0.000054048673,0.000021350434,0.000038387483,0.000011702655,0.000014675548,0.00066215754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809223,0.00066719326,0.000060725262,0.00027918865,0.00042982545,0.00047084322],"domain_scores_gemma":[0.9974164,0.0015156626,0.00033211996,0.0001679629,0.00037282007,0.00019502701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031022765,0.0010544509,0.0015597749,0.0007510079,0.0014326464,0.0021305245,0.0018994766,0.0013019962,0.0010627233],"category_scores_gemma":[0.005586149,0.00042792995,0.00052323524,0.0011790937,0.0014869933,0.0015811959,0.0020533723,0.0010062994,0.00017771617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019035714,0.000074035386,0.0008288586,0.00006130717,0.000045119494,0.0001937857,0.00012691383,0.9457702,0.004549667,0.024054807,0.0008090672,0.02329588],"study_design_scores_gemma":[0.0000057439706,0.000021847683,0.000065978566,0.0000028861352,0.0000061475484,0.000024144283,0.000018473089,0.9951929,0.00045077465,0.004044923,0.00015984985,0.000006351348],"about_ca_topic_score_codex":0.0048133326,"about_ca_topic_score_gemma":0.004509538,"teacher_disagreement_score":0.0048133326,"about_ca_system_score_codex":0.0019550733,"about_ca_system_score_gemma":0.0021085218,"threshold_uncertainty_score":0.016406596},"labels":[],"label_agreement":null},{"id":"W4399666016","doi":"10.1109/jsac.2024.3414932","title":"Variational Anonymous Quantum Sensing","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Quantum Information and Cryptography","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":"Memorial University of Newfoundland","funders":"National Research Foundation of Korea","keywords":"Computer science; Quantum; Computer network; Computer security; Quantum mechanics; Physics","score_opus":0.02797545616318897,"score_gpt":0.2915925482560826,"score_spread":0.26361709209289363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399666016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03653925,0.000295303,0.95178616,0.00033370388,0.000068939684,0.000068261645,0.00007543643,0.00021610559,0.010616902],"genre_scores_gemma":[0.8663007,0.0003202002,0.12862453,0.00028124297,0.000041781197,0.00010901277,0.00008428556,0.00008271297,0.0041555366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991259,0.0002803753,0.00003532073,0.00018006316,0.0002862714,0.00009202551],"domain_scores_gemma":[0.9989385,0.00050062395,0.00013355803,0.00024391354,0.00012426416,0.000059043068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589532,0.00044059957,0.0005151343,0.0003371019,0.00062551803,0.0010981549,0.0011031564,0.0010688743,0.002284124],"category_scores_gemma":[0.003106196,0.00030493058,0.00044312954,0.00036083677,0.0021894583,0.0016288676,0.0019942457,0.0010567538,0.00027671453],"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.00009643248,0.00004472406,0.0007094118,0.00012648158,0.000048210237,0.00010644582,0.0001580584,0.29407206,0.016723298,0.65300417,0.00118821,0.033722512],"study_design_scores_gemma":[0.000011992565,0.000048267586,0.00009971485,0.00001212455,0.0000084754465,0.0000396518,0.000022560642,0.8659282,0.0043907757,0.12679626,0.0026205569,0.000021443075],"about_ca_topic_score_codex":0.0011431942,"about_ca_topic_score_gemma":0.0010277472,"teacher_disagreement_score":0.002284124,"about_ca_system_score_codex":0.0010320452,"about_ca_system_score_gemma":0.0010795519,"threshold_uncertainty_score":0.0076411366},"labels":[],"label_agreement":null},{"id":"W4399666151","doi":"10.1109/jsac.2024.3414597","title":"WiShield: Privacy Against Wi-Fi Human Tracking","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Information privacy; Privacy protection; Computer security","score_opus":0.08218276517780866,"score_gpt":0.3832439479129203,"score_spread":0.3010611827351117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399666151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018088738,0.00029941334,0.9748549,0.0005311753,0.000046737565,0.00011631099,0.000117018935,0.0012465585,0.0046990975],"genre_scores_gemma":[0.8240172,0.00042663686,0.16843691,0.00035138565,0.00007504865,0.00018079627,0.00033131873,0.00012934452,0.006051278],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673706,0.00092614297,0.00017757744,0.0003934867,0.0013553791,0.00041025568],"domain_scores_gemma":[0.99635065,0.0014456948,0.00036461567,0.0012067775,0.00048567945,0.0001465257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036887445,0.00061686104,0.00061017403,0.000633101,0.0010599111,0.0019140663,0.0017119608,0.0016590765,0.0017310722],"category_scores_gemma":[0.00775192,0.0003058973,0.0007023916,0.00050983106,0.0016042327,0.003672727,0.0038622057,0.0016473675,0.00040794435],"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.00092338026,0.00026505365,0.0050216434,0.00029900676,0.0001722311,0.00096879853,0.0007236813,0.28345305,0.042550314,0.25481826,0.014760229,0.3960443],"study_design_scores_gemma":[0.00006223903,0.00024340693,0.0008420728,0.000039633207,0.000034150617,0.00054826034,0.0001452482,0.89733356,0.029148424,0.05922083,0.012320369,0.000061747625],"about_ca_topic_score_codex":0.0024443783,"about_ca_topic_score_gemma":0.0018989571,"teacher_disagreement_score":0.0036887445,"about_ca_system_score_codex":0.0010439423,"about_ca_system_score_gemma":0.001771253,"threshold_uncertainty_score":0.019508123},"labels":[],"label_agreement":null},{"id":"W4399666248","doi":"10.1109/jsac.2024.3414627","title":"Multiuser Association and Localization Over Doubly Dispersive Multipath Channels for Integrated Sensing and Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Simon Fraser University","funders":"National Natural Science Foundation of China; China Association for Science and Technology","keywords":"Computer science; Multipath propagation; Association (psychology); Telecommunications; Computer network; Data association; Electronic engineering; Channel (broadcasting); Artificial intelligence; Probabilistic logic","score_opus":0.02167535399593775,"score_gpt":0.27910652851539225,"score_spread":0.2574311745194545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399666248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077636256,0.00011799646,0.991037,0.000050959934,0.000012576114,0.000009998812,0.000021601512,0.00011374175,0.00087240274],"genre_scores_gemma":[0.6915444,0.00054747175,0.30447167,0.00016238239,0.000057963865,0.000080943835,0.00021234456,0.000046703062,0.0028761507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935824,0.00018957359,0.000019234245,0.00013382302,0.00021805889,0.00008119494],"domain_scores_gemma":[0.9992805,0.0003166585,0.00008542913,0.00014131975,0.00014197138,0.00003414183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057151966,0.0004835798,0.00045044583,0.00040802502,0.00032957218,0.0005744422,0.0009341438,0.0006073357,0.00084952614],"category_scores_gemma":[0.0021825875,0.000257347,0.00043165375,0.0008518428,0.00057355623,0.00095186615,0.0013053232,0.0007433532,0.00041124783],"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.00019137705,0.00007279062,0.0022373127,0.00014739743,0.000075379656,0.00019337812,0.00022062717,0.6486704,0.027244834,0.045243725,0.0021540315,0.2735488],"study_design_scores_gemma":[0.000004600391,0.000027242058,0.00020552063,0.000004583286,0.000007658231,0.0000669315,0.000017053093,0.9907584,0.0028167272,0.0051839026,0.00089817686,0.00000912539],"about_ca_topic_score_codex":0.0026792677,"about_ca_topic_score_gemma":0.0032260534,"teacher_disagreement_score":0.0026792677,"about_ca_system_score_codex":0.00049581093,"about_ca_system_score_gemma":0.0008419814,"threshold_uncertainty_score":0.0053274035},"labels":[],"label_agreement":null},{"id":"W4399768158","doi":"10.1109/jsac.2024.3379106","title":"Guest Editorial The Quantum Internet: Principles, Protocols and Architectures","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Quantum Computing Algorithms and Architecture","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 Ottawa","funders":"","keywords":"Computer science; Computer network; The Internet; World Wide Web","score_opus":0.024513454646586823,"score_gpt":0.3131574253531464,"score_spread":0.28864397070655956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399768158","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059790178,0.0037999118,0.00025982893,0.018919522,0.9730698,0.000019323794,0.000034260458,0.00007136436,0.0037661756],"genre_scores_gemma":[0.00059707084,0.003423455,0.00010591511,0.005510019,0.97801375,0.000013906493,0.000020085177,0.000032938853,0.012282831],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976463,0.00025533576,0.0001964591,0.00026184696,0.0014538324,0.00018626326],"domain_scores_gemma":[0.99045485,0.003061649,0.0004745863,0.00027126362,0.0042259963,0.0015116759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030177773,0.002535643,0.0022905716,0.0022531182,0.0021108123,0.0059770453,0.002137001,0.0071711116,0.016249036],"category_scores_gemma":[0.01062597,0.0008143845,0.0013484342,0.0009913972,0.0019971754,0.004005405,0.0010082643,0.014289072,0.014837823],"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.000030518255,0.000014323371,0.000018275827,0.00015358157,0.000008512619,0.000102019374,0.000009044352,0.00004680396,0.000089174784,0.0008425196,0.99142903,0.007256112],"study_design_scores_gemma":[0.00002938095,0.000019478995,0.000105200575,0.00016885735,0.000017594819,0.0001835,0.000021844711,0.0002319027,0.00015586117,0.0014549877,0.99760014,0.000011087045],"about_ca_topic_score_codex":0.00052225223,"about_ca_topic_score_gemma":0.0012585572,"teacher_disagreement_score":0.016249036,"about_ca_system_score_codex":0.0017137319,"about_ca_system_score_gemma":0.0014872773,"threshold_uncertainty_score":0.054358423},"labels":[],"label_agreement":null},{"id":"W4400488979","doi":"10.1109/jsac.2024.3423629","title":"Positioning Using Wireless Networks: Applications, Recent Progress, and Future Challenges","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization 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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless network; Wireless; Telecommunications; Computer network","score_opus":0.023285538016640434,"score_gpt":0.2765850524140299,"score_spread":0.2532995143973895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400488979","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.0028876478,0.9546335,0.013798049,0.015384646,0.0019367808,0.000023887827,0.000083284125,0.000089455876,0.01116278],"genre_scores_gemma":[0.02294263,0.9628462,0.006732485,0.0015040733,0.0038747375,0.000028781245,0.000108532724,0.0000227691,0.0019398313],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853575,0.00045588572,0.0001430351,0.00022781845,0.0005220902,0.00011543493],"domain_scores_gemma":[0.99544215,0.0027103005,0.0002824393,0.00020144411,0.0012091305,0.00015452738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429948,0.0006626106,0.0006757022,0.0016864206,0.00065650174,0.0029730857,0.0010513269,0.0019198669,0.0026877502],"category_scores_gemma":[0.004394097,0.0003840225,0.00038241458,0.0042199316,0.0016840021,0.008214583,0.001570852,0.0023511918,0.0011675874],"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.000062849045,0.000055850294,0.001761758,0.005330152,0.00003454208,0.00014606824,0.0003906831,0.003870656,0.0012737522,0.089269295,0.02334214,0.87446225],"study_design_scores_gemma":[0.000011238804,0.00026914186,0.0030728055,0.0044578095,0.00008633233,0.0011021973,0.0018106874,0.009531125,0.0013904461,0.07289414,0.90527135,0.00010258927],"about_ca_topic_score_codex":0.0016294795,"about_ca_topic_score_gemma":0.0015588914,"teacher_disagreement_score":0.003429948,"about_ca_system_score_codex":0.0012461507,"about_ca_system_score_gemma":0.001609086,"threshold_uncertainty_score":0.018139541},"labels":[],"label_agreement":null},{"id":"W4400877879","doi":"10.1109/jsac.2024.3431579","title":"Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Decoding methods; Binary number; Polar; Sequential decoding; List decoding; Algorithm; Binary code; Quadratic equation; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; Mathematics","score_opus":0.05457634294375869,"score_gpt":0.3419000424481128,"score_spread":0.2873236995043541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400877879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014193614,0.00022434052,0.97847444,0.00018400607,0.000033584027,0.000033224525,0.00006686335,0.00015865128,0.0066313515],"genre_scores_gemma":[0.40747333,0.0008183198,0.5810956,0.00029168715,0.000061624945,0.00015717417,0.00041961108,0.00019037022,0.0094922995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956447,0.00015360197,0.000020572363,0.000064639215,0.00015186328,0.000044892495],"domain_scores_gemma":[0.9993358,0.00039068933,0.00006556372,0.000054230386,0.00013451328,0.000019195206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062178914,0.00067151204,0.0005288062,0.00035234002,0.00030136073,0.00086064107,0.00038459938,0.0006773553,0.002261919],"category_scores_gemma":[0.002091815,0.00030284692,0.00040423518,0.0005264706,0.0006545884,0.0007360234,0.00084480137,0.0009231024,0.0007122345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113282134,0.000034339915,0.000507385,0.0001655746,0.000034749544,0.00012860294,0.00009168042,0.83912426,0.009632967,0.087790765,0.0017826107,0.06059367],"study_design_scores_gemma":[0.000010817543,0.00002959438,0.000054811724,0.000012053889,0.0000041671824,0.000036147998,0.000011815943,0.98490125,0.0035629817,0.010034968,0.0013338546,0.000007533641],"about_ca_topic_score_codex":0.0017970497,"about_ca_topic_score_gemma":0.0024916858,"teacher_disagreement_score":0.002261919,"about_ca_system_score_codex":0.0005059403,"about_ca_system_score_gemma":0.0011895037,"threshold_uncertainty_score":0.0075668097},"labels":[],"label_agreement":null},{"id":"W4401567372","doi":"10.1109/jsac.2024.3443759","title":"A Survey of Recent Advances in Optimization Methods for Wireless Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced MIMO Systems Optimization","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 Toronto","funders":"National Natural Science Foundation of China; Canada Research Chairs","keywords":"Computer science; Wireless; Telecommunications; Computer network","score_opus":0.06791874814181002,"score_gpt":0.3948826588420869,"score_spread":0.32696391070027686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401567372","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.0015766509,0.31378183,0.6593482,0.0032772692,0.0014701379,0.000051788713,0.0001950698,0.00024428836,0.020054745],"genre_scores_gemma":[0.04196428,0.6957551,0.24179618,0.0017143246,0.0073129195,0.00022622338,0.0005594637,0.0004012336,0.010270234],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984066,0.0005823917,0.00016113945,0.00021476565,0.0005639966,0.000071140756],"domain_scores_gemma":[0.9970987,0.0021465854,0.00012688617,0.00014933346,0.00042873653,0.00004981669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023423734,0.0016684614,0.0016333167,0.0020616318,0.00046285102,0.00204142,0.0014003603,0.0014611906,0.0055377455],"category_scores_gemma":[0.0053270715,0.00072978874,0.0014203421,0.0041616256,0.00093056215,0.002803736,0.0011731728,0.0030479901,0.0026219196],"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.00007902041,0.0001422195,0.00087602483,0.005207139,0.00020941968,0.0001821574,0.00015643072,0.071438745,0.002170643,0.265502,0.042150427,0.6118857],"study_design_scores_gemma":[0.000034132663,0.00017955981,0.0011168229,0.0017215079,0.00012953352,0.0007244291,0.00012722936,0.278272,0.0017538416,0.22744301,0.48839387,0.0001041547],"about_ca_topic_score_codex":0.001391543,"about_ca_topic_score_gemma":0.0012666333,"teacher_disagreement_score":0.0055377455,"about_ca_system_score_codex":0.0009084932,"about_ca_system_score_gemma":0.0013796437,"threshold_uncertainty_score":0.0185256},"labels":[],"label_agreement":null},{"id":"W4401870958","doi":"10.1109/jsac.2024.3423608","title":"Guest Editorial Positioning and Sensing Over Wireless Networks—Part I","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization 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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless; Telecommunications; Wireless network","score_opus":0.008601224246973658,"score_gpt":0.25448842771305447,"score_spread":0.2458872034660808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401870958","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004877656,0.008770183,0.0003561946,0.013789561,0.9741002,0.000019780797,0.000033397937,0.000050879466,0.0028310174],"genre_scores_gemma":[0.00049605436,0.009060624,0.00013437179,0.0051475763,0.9754347,0.00001642195,0.000022119317,0.00002978765,0.009658344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795353,0.00020987546,0.0002082287,0.00030606237,0.0011762073,0.0001460967],"domain_scores_gemma":[0.9910157,0.0026681726,0.0004455132,0.00023286344,0.0042556273,0.001382156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024561035,0.0030504412,0.0023279584,0.0024856806,0.0017250725,0.0063430555,0.0023524337,0.008032803,0.014315975],"category_scores_gemma":[0.008929275,0.0007235559,0.0014235509,0.0011564185,0.0015460169,0.0036087073,0.0011069366,0.012324132,0.014645731],"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.00004078167,0.00001880319,0.00003205144,0.000309783,0.000013205519,0.00017220216,0.000011127207,0.000074773496,0.00015668676,0.0007278666,0.9850835,0.013359139],"study_design_scores_gemma":[0.000021246993,0.000041500527,0.00014012615,0.00027067008,0.000022849434,0.0004224343,0.00002191162,0.00025099228,0.00018480503,0.00095046905,0.997658,0.000014960963],"about_ca_topic_score_codex":0.00059950474,"about_ca_topic_score_gemma":0.0010729879,"teacher_disagreement_score":0.014315975,"about_ca_system_score_codex":0.0016366988,"about_ca_system_score_gemma":0.0012832755,"threshold_uncertainty_score":0.047891676},"labels":[],"label_agreement":null},{"id":"W4402509384","doi":"10.1109/jsac.2024.3460061","title":"Quantum-Enhanced DRL Optimization for DoA Estimation and Task Offloading in ISAC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":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; Agence Nationale de la Recherche","keywords":"Computer science; Task (project management); Computer network; Distributed computing","score_opus":0.03278863216583452,"score_gpt":0.31073003409909944,"score_spread":0.27794140193326494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402509384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023484314,0.0003139249,0.97090954,0.0003090597,0.000058138976,0.000030313762,0.00004149802,0.00039666644,0.0044564167],"genre_scores_gemma":[0.9311978,0.00018223254,0.06578025,0.00021735359,0.000039841092,0.00006788421,0.00006709168,0.00006323046,0.0023841832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996687,0.00008771222,0.000012824758,0.00006775936,0.000096814896,0.00006614883],"domain_scores_gemma":[0.99938715,0.00033410286,0.00006536325,0.000053824213,0.00012160815,0.000037823356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570166,0.0006183196,0.00072906516,0.00025252308,0.00040153824,0.0007213981,0.0009126346,0.0006456896,0.0018290813],"category_scores_gemma":[0.0022891087,0.00032840233,0.00034100655,0.00028725885,0.00088135124,0.00091200264,0.00091858336,0.0011577234,0.00025814248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046755267,0.000028383965,0.00044154556,0.000036245667,0.000015905252,0.000033372573,0.000032514552,0.96977454,0.0016524397,0.0067497157,0.00072628347,0.020462202],"study_design_scores_gemma":[0.000003007262,0.000006881105,0.000028668182,0.0000014666625,0.0000015498448,0.000003027783,0.000001912967,0.9986076,0.00017458676,0.0010421439,0.00012754466,0.0000016486483],"about_ca_topic_score_codex":0.007473443,"about_ca_topic_score_gemma":0.0073214546,"teacher_disagreement_score":0.007473443,"about_ca_system_score_codex":0.0008972188,"about_ca_system_score_gemma":0.0016488024,"threshold_uncertainty_score":0.014859855},"labels":[],"label_agreement":null},{"id":"W4402592617","doi":"10.1109/jsac.2024.3423628","title":"Guest Editorial Positioning and Sensing Over Wireless Networks—Part II","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization 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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Telecommunications; Wireless; Wireless network","score_opus":0.008415893710896533,"score_gpt":0.2526477762908094,"score_spread":0.24423188257991288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402592617","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004741281,0.0050525246,0.00032892186,0.009571461,0.98210645,0.000012156289,0.00002920339,0.00003667183,0.0028152096],"genre_scores_gemma":[0.0006941948,0.0052176327,0.00012985372,0.0041662375,0.97608227,0.000014833841,0.000023853401,0.000035819878,0.013635323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976908,0.0002611668,0.00021502838,0.00037236043,0.0012803121,0.00018030625],"domain_scores_gemma":[0.9913455,0.0023474745,0.0004226349,0.00026773268,0.004269139,0.0013475746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025283669,0.0023405845,0.0017957892,0.0024753697,0.0016494249,0.0054391385,0.0015025666,0.0050179563,0.017312786],"category_scores_gemma":[0.008355865,0.0005492284,0.0011826447,0.00095409615,0.0012835078,0.0028820827,0.0011322334,0.008601003,0.013416453],"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.000037473244,0.0000122091105,0.000024793422,0.00020610698,0.000008597321,0.00009762684,0.000011704081,0.00006303269,0.00018224715,0.0010056,0.9874648,0.010885755],"study_design_scores_gemma":[0.00001306033,0.00003314241,0.000109823515,0.00017725641,0.000014263266,0.00021577955,0.000024344172,0.0001989404,0.00020759275,0.0009791119,0.99801695,0.00000966476],"about_ca_topic_score_codex":0.0004147581,"about_ca_topic_score_gemma":0.00072963233,"teacher_disagreement_score":0.017312786,"about_ca_system_score_codex":0.0014205438,"about_ca_system_score_gemma":0.0013521481,"threshold_uncertainty_score":0.05791706},"labels":[],"label_agreement":null},{"id":"W4402895031","doi":"10.1109/jsac.2024.3460034","title":"Joint Optimization of User Association, Power Control, and Dynamic Spectrum Sharing for Integrated Aerial-Terrestrial Network","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Satellite 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 Waterloo","funders":"","keywords":"Computer science; Joint (building); Association (psychology); Power control; Computer network; Power (physics); Telecommunications","score_opus":0.021693492993062998,"score_gpt":0.2685126723806574,"score_spread":0.2468191793875944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402895031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056575384,0.00031383353,0.94001055,0.00012629839,0.000028961911,0.00003984561,0.000028896082,0.000121151556,0.0027551583],"genre_scores_gemma":[0.94766873,0.00016095406,0.050365593,0.00004916993,0.000026362022,0.00006106343,0.000039342733,0.000020229165,0.001608574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.00026498668,0.000026956794,0.00019115277,0.00019314389,0.00021468323],"domain_scores_gemma":[0.9994843,0.00025469932,0.00009754748,0.00003536475,0.00007664999,0.0000513845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092580065,0.0009911654,0.0010574078,0.0003479878,0.00042635965,0.00090157177,0.0011825247,0.0006724314,0.0009469778],"category_scores_gemma":[0.0012117876,0.00040374472,0.00045819083,0.00072169653,0.00067289127,0.0009946792,0.0010244888,0.0006882971,0.0001288699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067216,0.00007537529,0.0004887779,0.000035094978,0.000039619885,0.00008754759,0.00003989652,0.9678104,0.002299652,0.0049890294,0.00050254527,0.02355144],"study_design_scores_gemma":[0.0000062755976,0.000024146511,0.00006914124,8.591597e-7,0.0000049283904,0.000013742244,0.000007769597,0.99880767,0.00022697063,0.00072926556,0.00010723276,0.00000201071],"about_ca_topic_score_codex":0.0059376457,"about_ca_topic_score_gemma":0.0067143845,"teacher_disagreement_score":0.0059376457,"about_ca_system_score_codex":0.0009343392,"about_ca_system_score_gemma":0.0014451033,"threshold_uncertainty_score":0.01180613},"labels":[],"label_agreement":null},{"id":"W4403510731","doi":"10.1109/jsac.2024.3443808","title":"Guest Editorial Advanced Optimization Theory and Algorithms for Next-Generation Wireless Communication Networks","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Wireless; Wireless network; Computer network; Distributed computing; Telecommunications","score_opus":0.04179680149769725,"score_gpt":0.33830435638525774,"score_spread":0.2965075548875605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403510731","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045182634,0.0037622927,0.0006670089,0.0171858,0.97609407,0.000015478608,0.000045807185,0.000043589094,0.0021406896],"genre_scores_gemma":[0.000509565,0.0026912037,0.00023433776,0.0039485865,0.9857399,0.000015034511,0.000018509812,0.000027813638,0.0068150577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969902,0.0005294436,0.00028187354,0.00035013497,0.0016483668,0.00019993716],"domain_scores_gemma":[0.9856146,0.0050710775,0.0007860885,0.00033351604,0.006416513,0.0017782755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047400794,0.0031415543,0.0032442992,0.003290828,0.0017186333,0.0062740515,0.002322684,0.007980709,0.01655539],"category_scores_gemma":[0.017615434,0.00075782643,0.0018950612,0.0011858642,0.0018313497,0.002620612,0.0010809639,0.012211767,0.009467447],"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.00004529943,0.000015909483,0.000020598793,0.00021644543,0.000023604314,0.00011437822,0.0000049581436,0.000117763215,0.00007618171,0.0010700545,0.9888497,0.0094450405],"study_design_scores_gemma":[0.000115079005,0.000056826455,0.00019618808,0.00031435885,0.00007562037,0.000319035,0.000019240439,0.0012644454,0.00025260018,0.005386094,0.9919714,0.000029050172],"about_ca_topic_score_codex":0.00045561223,"about_ca_topic_score_gemma":0.0011639267,"teacher_disagreement_score":0.01655539,"about_ca_system_score_codex":0.0017405231,"about_ca_system_score_gemma":0.0015008893,"threshold_uncertainty_score":0.055383325},"labels":[],"label_agreement":null},{"id":"W4404179523","doi":"10.1109/jsac.2024.3492699","title":"Resource Allocation for Adaptive Beam Alignment in UAV-Assisted Integrated Sensing and Communication Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and 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":"Key Industry Innovation Chain of Shaanxi; National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Resource management (computing); Resource (disambiguation); Computer network; Integrated optics; Distributed computing; Telecommunications","score_opus":0.0220462117012261,"score_gpt":0.2590060062042014,"score_spread":0.23695979450297527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404179523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041680116,0.00056051405,0.95454615,0.00018270974,0.000039331713,0.000033572036,0.000036910053,0.00017299435,0.0027477292],"genre_scores_gemma":[0.9554126,0.00020638976,0.042835444,0.00009066183,0.000024978437,0.000070187234,0.00003602927,0.000020373493,0.0013033906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932194,0.00019725582,0.000022466678,0.00015795538,0.000145345,0.00015506873],"domain_scores_gemma":[0.999243,0.0004260658,0.00012846779,0.000045846504,0.00011093685,0.00004574265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008391712,0.0007090451,0.000815394,0.00032925094,0.0004285408,0.00064079685,0.0009972365,0.00058225647,0.0010952553],"category_scores_gemma":[0.0021889752,0.0003332956,0.00026727607,0.0005544067,0.000674488,0.0010491143,0.0010825647,0.00073378853,0.00016321831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011119349,0.00005780191,0.00065297564,0.000058639635,0.00002917031,0.00009132347,0.000072455805,0.9478515,0.0039974325,0.007603006,0.0009413809,0.03853309],"study_design_scores_gemma":[0.0000038806033,0.000017295923,0.00006203987,0.0000020959455,0.0000034161558,0.000012928105,0.000007879403,0.9981654,0.00032804013,0.0012780828,0.000116369265,0.0000024928522],"about_ca_topic_score_codex":0.004816868,"about_ca_topic_score_gemma":0.0048744967,"teacher_disagreement_score":0.004816868,"about_ca_system_score_codex":0.00076067174,"about_ca_system_score_gemma":0.0010574532,"threshold_uncertainty_score":0.009577632},"labels":[],"label_agreement":null},{"id":"W4407736556","doi":"10.1109/jsac.2025.3543517","title":"Modeling of UV NLoS Communication Channels: From Atmospheric Scattering and Obstacle Reflection Perspectives","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Wireless Communication Technologies","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, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; Toyota Motor Corporation; National Science Foundation","keywords":"Non-line-of-sight propagation; Computer science; Reflection (computer programming); Obstacle; Scattering; Ray tracing (physics); Atmospheric model; Telecommunications; Optics; Wireless; Physics","score_opus":0.027126714819186357,"score_gpt":0.28487058951752225,"score_spread":0.2577438746983359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407736556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04793723,0.0007027465,0.9400037,0.00024512864,0.00007666614,0.000063724154,0.00018526553,0.00031612604,0.010469451],"genre_scores_gemma":[0.92157155,0.0025191838,0.0657914,0.00013839889,0.00011947579,0.00016464201,0.0002978491,0.00012316543,0.009274239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.00008520161,0.000012490994,0.00006101972,0.0001514145,0.00006934535],"domain_scores_gemma":[0.999689,0.00011003858,0.000063493804,0.000035493373,0.00008568325,0.000016313932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032712054,0.0009021346,0.0005538944,0.00055127643,0.00045854147,0.0011021176,0.0012228959,0.00090572087,0.0008941235],"category_scores_gemma":[0.0007105942,0.00039466645,0.00080733007,0.0007767551,0.000727731,0.0015584781,0.00081553776,0.0007848746,0.00029590292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018386547,0.00002185711,0.0009638489,0.000053047752,0.000013793351,0.00015119812,0.0000793039,0.9761612,0.0039096316,0.010570678,0.0004205455,0.0076364586],"study_design_scores_gemma":[0.0000018972282,0.000009224514,0.00014688214,0.000003815748,0.000004717121,0.00003791523,0.00002190848,0.9972753,0.00045708966,0.0015886859,0.00044638646,0.0000062229433],"about_ca_topic_score_codex":0.0070004566,"about_ca_topic_score_gemma":0.0039567957,"teacher_disagreement_score":0.0070004566,"about_ca_system_score_codex":0.0006800444,"about_ca_system_score_gemma":0.0009582379,"threshold_uncertainty_score":0.013919413},"labels":[],"label_agreement":null},{"id":"W4407736576","doi":"10.1109/jsac.2025.3543528","title":"Synergizing Hyper-Accelerated Power Optimization and Wavelength-Dependent QoT-Aware Cross-Layer Design in Next-Generation Multi-Band EONs","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Optical Network 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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Carlos III de Madrid","keywords":"Computer science; Power (physics); Computer network; Optoelectronics; Materials science; Physics","score_opus":0.09448779833203037,"score_gpt":0.314197877801718,"score_spread":0.21971007946968762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407736576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17917009,0.0010038326,0.8068805,0.0002530821,0.00006567226,0.000084463776,0.000028984572,0.0005385593,0.011974885],"genre_scores_gemma":[0.90720356,0.00026874294,0.090752274,0.00008569216,0.00001693172,0.00005463177,0.00002463316,0.000085792904,0.001507673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978095,0.000049433394,0.0000069084017,0.000037147405,0.00008015151,0.00004537834],"domain_scores_gemma":[0.9997831,0.0000626441,0.00005370169,0.000029428315,0.000053685864,0.000017500135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543589,0.0005110888,0.00025580294,0.00030395246,0.00019595028,0.00064126664,0.0005712539,0.0002825996,0.0007886307],"category_scores_gemma":[0.00057919614,0.00026488886,0.00025504045,0.00018325419,0.00046513148,0.0006794934,0.0005674457,0.0004415851,0.00020270169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009067386,0.000119027136,0.0013832214,0.00009287398,0.000055294615,0.00013245287,0.00009362348,0.8473114,0.08156657,0.0106427865,0.00066699757,0.057845067],"study_design_scores_gemma":[0.000008875322,0.00010759269,0.00030683645,0.0000085494075,0.000010422608,0.0000317689,0.00001867284,0.9822482,0.013190179,0.0024816617,0.0015786125,0.000008718412],"about_ca_topic_score_codex":0.0006869628,"about_ca_topic_score_gemma":0.0014871086,"teacher_disagreement_score":0.0007886307,"about_ca_system_score_codex":0.0005057349,"about_ca_system_score_gemma":0.00057543715,"threshold_uncertainty_score":0.0036693215},"labels":[],"label_agreement":null},{"id":"W4407736613","doi":"10.1109/jsac.2025.3543548","title":"Minimizing Fiber’s Nonlinear Interference Noise by Designing Launched Signal PSD","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Fiber Optic Sensors","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Computer science; Launched; Interference (communication); Phase noise; Telecommunications; Noise (video); Nonlinear system; SIGNAL (programming language); Electronic engineering; Electrical engineering; Physics; Artificial intelligence; Engineering","score_opus":0.023867319098894665,"score_gpt":0.28309469559552103,"score_spread":0.25922737649662636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407736613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10531998,0.00027725895,0.8870296,0.00015655693,0.000022731232,0.00007175113,0.000037811304,0.00014379164,0.0069404664],"genre_scores_gemma":[0.7936567,0.00049245876,0.20408493,0.00006458982,0.000021521657,0.00009568597,0.00003547563,0.00006902829,0.0014795978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971217,0.00005486434,0.00001429469,0.000054265864,0.0001250588,0.00003938295],"domain_scores_gemma":[0.9996265,0.00013871555,0.00011652815,0.000031514268,0.000072633215,0.000013984051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047772407,0.00067878957,0.0003217367,0.00029076397,0.00021665206,0.00051894045,0.0003783918,0.0004759886,0.00042925103],"category_scores_gemma":[0.0012030539,0.00020873596,0.0002431531,0.00038483908,0.0005269214,0.00063461124,0.00044920496,0.00031334747,0.00021018808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009059238,0.00014986483,0.0012106583,0.0002697122,0.000049729086,0.00014193925,0.00014156586,0.58890545,0.3388281,0.030322246,0.00050229917,0.03938781],"study_design_scores_gemma":[0.000017625389,0.00019490904,0.00051058887,0.000020471816,0.000024487214,0.000114773706,0.000032122516,0.8890315,0.10449333,0.003361857,0.0021764264,0.000021952164],"about_ca_topic_score_codex":0.00053871324,"about_ca_topic_score_gemma":0.00076858874,"teacher_disagreement_score":0.00069567846,"about_ca_system_score_codex":0.00069567846,"about_ca_system_score_gemma":0.00087949145,"threshold_uncertainty_score":0.0050475},"labels":[],"label_agreement":null},{"id":"W4407737096","doi":"10.1109/jsac.2025.3543495","title":"Soft Demapping of Spherical Codes From Cartesian Powers of PAM Constellations","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Metal Forming Simulation 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":"Huawei Technologies","keywords":"Computer science; Constellation; Telecommunications; Computer network; Theoretical computer science; Physics","score_opus":0.020723219662014007,"score_gpt":0.29194871431895997,"score_spread":0.27122549465694595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407737096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35716844,0.00016608482,0.633359,0.00012783406,0.000027919516,0.00004258879,0.000075009295,0.00026083994,0.008772303],"genre_scores_gemma":[0.88971704,0.00011711536,0.10719009,0.00005059374,0.000012045142,0.00003121419,0.00010038745,0.00004349142,0.0027379727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977106,0.00005279175,0.00001293984,0.000028994553,0.00010212402,0.000032064127],"domain_scores_gemma":[0.9993374,0.00024266334,0.00012230048,0.00017194875,0.000089136185,0.000036494857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653221,0.00030634267,0.00023071362,0.0003258655,0.0002484219,0.00035384737,0.00032435945,0.00025304535,0.0011128596],"category_scores_gemma":[0.0018408509,0.0001528374,0.00028405554,0.0003264171,0.000836337,0.000632996,0.00082437217,0.00045629413,0.0002835028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046431986,0.000054914402,0.0017724643,0.00016637189,0.000037869064,0.000624598,0.00060462905,0.4618237,0.22891289,0.21207844,0.0005756048,0.09288425],"study_design_scores_gemma":[0.000011968525,0.00022435132,0.0010442708,0.000022830798,0.000008683388,0.00037999003,0.00009369129,0.8266321,0.13292739,0.036188036,0.0024262709,0.000040378018],"about_ca_topic_score_codex":0.00057334494,"about_ca_topic_score_gemma":0.0006902773,"teacher_disagreement_score":0.0011128596,"about_ca_system_score_codex":0.00037613753,"about_ca_system_score_gemma":0.00040966878,"threshold_uncertainty_score":0.0037228465},"labels":[],"label_agreement":null},{"id":"W4407830027","doi":"10.1109/jsac.2025.3543522","title":"On Precoding for Optical Wireless MISO Broadcasting—An Information Theoretic Perspective","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Photonic 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, Okanagan Campus; University of British Columbia; McMaster University","funders":"","keywords":"Precoding; Computer science; Perspective (graphical); Broadcasting (networking); Wireless; Computer network; Telecommunications; Zero-forcing precoding; MIMO; Channel (broadcasting); Artificial intelligence","score_opus":0.0215221183229253,"score_gpt":0.3147222962521163,"score_spread":0.293200177929191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407830027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0346915,0.0021586025,0.94650555,0.0007043581,0.00010593909,0.00004332582,0.000095246534,0.00009587115,0.015599657],"genre_scores_gemma":[0.8968313,0.004182741,0.093645215,0.00027571543,0.00025443616,0.00010035817,0.00008420274,0.000042408694,0.00458371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954563,0.00016165148,0.000013014747,0.000044596283,0.00016990132,0.00006520084],"domain_scores_gemma":[0.99832684,0.0012485719,0.00012231732,0.00010150697,0.0001764296,0.000024409092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069950917,0.0005900037,0.0005153477,0.00045715642,0.0004038523,0.0009250159,0.00051200745,0.00063870364,0.0015324528],"category_scores_gemma":[0.0030191506,0.00021055095,0.00034280078,0.00066138693,0.0015070646,0.0009745567,0.00066553644,0.0008527413,0.00028039698],"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.00011691564,0.00004301857,0.00036717264,0.00021748245,0.000028477743,0.00022363855,0.0002039239,0.6212951,0.014158548,0.3357373,0.0013644494,0.026243994],"study_design_scores_gemma":[0.000011723401,0.0000954875,0.00015578074,0.00003766904,0.000011738997,0.00012747989,0.000050138406,0.9428113,0.0044822004,0.050408393,0.0017847997,0.00002324069],"about_ca_topic_score_codex":0.0020354213,"about_ca_topic_score_gemma":0.0018711337,"teacher_disagreement_score":0.0020354213,"about_ca_system_score_codex":0.0009963001,"about_ca_system_score_gemma":0.00076783623,"threshold_uncertainty_score":0.007228732},"labels":[],"label_agreement":null},{"id":"W4409474257","doi":"10.1109/jsac.2025.3560012","title":"Decentralized Federated Graph Learning With Lightweight Zero Trust Architecture for Next-Generation Networking Security","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; Japan Society for the Promotion of Science","keywords":"Computer science; Architecture; Graph; Computer network; Computer security; Distributed computing; Theoretical computer science","score_opus":0.04765540723131068,"score_gpt":0.2994238682421356,"score_spread":0.25176846101082495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409474257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04105795,0.0002710962,0.95483005,0.00042981096,0.00004812812,0.000037374524,0.00004273775,0.0011414686,0.0021414545],"genre_scores_gemma":[0.9413345,0.00014339486,0.05595351,0.00017152399,0.00001868388,0.000062731146,0.00009964418,0.000045131696,0.0021708931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994752,0.00013773721,0.000023437586,0.00015544733,0.000101041296,0.00010713969],"domain_scores_gemma":[0.9994929,0.0001312263,0.000070963244,0.00012683266,0.00012145794,0.000056592264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083776267,0.00049856794,0.0006869186,0.0003530249,0.0005270698,0.00076809345,0.0015243944,0.00083935354,0.0012506905],"category_scores_gemma":[0.0017983709,0.0002367517,0.0005213067,0.0003844478,0.00094637653,0.0015491452,0.0016473385,0.0012957532,0.00026522347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012427187,0.000087739565,0.0009358472,0.000054446118,0.000054395518,0.00009973725,0.00011089945,0.89206487,0.0047656046,0.029143147,0.0019229451,0.07063609],"study_design_scores_gemma":[0.000004165386,0.000018292376,0.00006214164,0.000001821094,0.000005354801,0.000009428723,0.0000067407964,0.99162674,0.000395339,0.0075797383,0.00028688414,0.0000033690276],"about_ca_topic_score_codex":0.0060831183,"about_ca_topic_score_gemma":0.007157833,"teacher_disagreement_score":0.0060831183,"about_ca_system_score_codex":0.0012470632,"about_ca_system_score_gemma":0.0016622753,"threshold_uncertainty_score":0.012095451},"labels":[],"label_agreement":null},{"id":"W4409474276","doi":"10.1109/jsac.2025.3560359","title":"Information Compression in the AI Era: Recent Advances and Future Challenges","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Computability, Logic, AI Algorithms","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 Toronto; McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data compression; Data science; Telecommunications; Artificial intelligence","score_opus":0.024262840188963703,"score_gpt":0.31032110657214346,"score_spread":0.28605826638317977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409474276","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.002072842,0.9409323,0.021513091,0.026309097,0.0013070296,0.000017788287,0.000059079346,0.00010792799,0.0076808254],"genre_scores_gemma":[0.027706355,0.93764496,0.019039944,0.003537943,0.009443448,0.000047182464,0.00012437944,0.00005967324,0.0023961335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987477,0.0003814697,0.00010057987,0.00018722123,0.00048823492,0.00009469506],"domain_scores_gemma":[0.982969,0.013704066,0.0004231853,0.000615301,0.0018851935,0.00040335878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043878015,0.00067663944,0.0011310035,0.002285733,0.0008371996,0.0041085985,0.0017915589,0.0027494347,0.006606678],"category_scores_gemma":[0.010055026,0.0004354095,0.0005169851,0.0040236856,0.0032182,0.011174164,0.0022684701,0.004411326,0.001882013],"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.00010446621,0.000085282925,0.0005821623,0.0029826781,0.00004529817,0.0001106649,0.0002603351,0.0028474422,0.000658618,0.15865286,0.027276395,0.8063938],"study_design_scores_gemma":[0.000041042982,0.00025202852,0.0011995055,0.00360706,0.00006843979,0.0011921782,0.0012387445,0.02429645,0.001766451,0.45668137,0.50954473,0.000112110356],"about_ca_topic_score_codex":0.00082043966,"about_ca_topic_score_gemma":0.0008173107,"teacher_disagreement_score":0.006606678,"about_ca_system_score_codex":0.0013489781,"about_ca_system_score_gemma":0.0016107507,"threshold_uncertainty_score":0.023205161},"labels":[],"label_agreement":null},{"id":"W4410428413","doi":"10.1109/jsac.2025.3547164","title":"Guest Editorial: Next-Generation Optical Communications and Networking","year":2025,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced 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":"Infineon Technologies (Canada)","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Computer science; Telecommunications; Optical communication; Computer network; Optoelectronics","score_opus":0.03684152091477939,"score_gpt":0.2996723016868771,"score_spread":0.2628307807720977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410428413","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036945814,0.0025241056,0.00009307853,0.013139666,0.9823866,0.000019208226,0.000029862107,0.00004739518,0.0017230496],"genre_scores_gemma":[0.00034669385,0.0030603635,0.0000696077,0.008910232,0.9767869,0.00001623113,0.000030511255,0.00002661579,0.010752814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99633396,0.00043757548,0.0003499569,0.00044779,0.002128584,0.00030214712],"domain_scores_gemma":[0.9886657,0.0028615037,0.0006951638,0.0002890124,0.0046848794,0.0028038276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004432629,0.0039661145,0.0031794987,0.0030318361,0.0028637797,0.007700408,0.0027909956,0.012121385,0.02285397],"category_scores_gemma":[0.013092116,0.0011060344,0.002344449,0.0012594123,0.001987673,0.0045904373,0.0014355704,0.015916763,0.024763852],"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.00004003326,0.000019314266,0.000024189296,0.00016279679,0.000011255645,0.00015966308,0.00000787765,0.000031930573,0.00009486275,0.0002590051,0.9939865,0.0052026478],"study_design_scores_gemma":[0.000060327897,0.00004752763,0.00025884336,0.00028507144,0.000029257028,0.0004020807,0.00003800111,0.00020997888,0.00016459223,0.00091822044,0.9975668,0.000019297773],"about_ca_topic_score_codex":0.00076957967,"about_ca_topic_score_gemma":0.002392721,"teacher_disagreement_score":0.02285397,"about_ca_system_score_codex":0.0021859028,"about_ca_system_score_gemma":0.0023334282,"threshold_uncertainty_score":0.07645416},"labels":[],"label_agreement":null},{"id":"W4410809435","doi":"10.1109/jsac.2025.3574616","title":"Digital Twin-Driven MADRL Approaches for Communication-Computing-Control Co-Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Control (management); Distributed computing; Computer network; Artificial intelligence","score_opus":0.032025855659254705,"score_gpt":0.2698867797308226,"score_spread":0.2378609240715679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410809435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006070467,0.00024239089,0.9898891,0.0001676746,0.000053039737,0.000025690764,0.000019088151,0.00020974583,0.0033228633],"genre_scores_gemma":[0.7719709,0.00046537997,0.21864665,0.0003470357,0.000112356225,0.00021291514,0.00012520325,0.00019914848,0.007920374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.000113413254,0.00002170636,0.00010803592,0.00012077522,0.000076029086],"domain_scores_gemma":[0.9993839,0.00032317408,0.00006369485,0.00006973776,0.00011337079,0.00004593613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009495722,0.00095895625,0.00087280356,0.00041806712,0.00042040442,0.001081656,0.0014988983,0.00084796845,0.003566035],"category_scores_gemma":[0.001978678,0.00042224818,0.00055833627,0.0005172594,0.0009469561,0.0010780088,0.0017832154,0.0015851507,0.00047228753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006148132,0.000043267988,0.00032211174,0.00005998172,0.000032231746,0.00005976304,0.000050838098,0.9470241,0.0014051689,0.016697682,0.0009885819,0.03325484],"study_design_scores_gemma":[0.0000048514817,0.000016977252,0.000026927972,0.000002622122,0.0000033406222,0.000007190575,0.0000044448,0.99610966,0.0002047917,0.0031630658,0.0004538641,0.0000022585639],"about_ca_topic_score_codex":0.0041088774,"about_ca_topic_score_gemma":0.003947553,"teacher_disagreement_score":0.0041088774,"about_ca_system_score_codex":0.00086861395,"about_ca_system_score_gemma":0.0012768394,"threshold_uncertainty_score":0.011929572},"labels":[],"label_agreement":null},{"id":"W4414229911","doi":"10.1109/jsac.2025.3610499","title":"Joint Airborne Wireless Positioning and Communication Services With Pattern Division Multiple Access (PDMA)","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in 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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Hybrid positioning system; Provisioning; Joint (building); Key (lock); Wireless; Throughput; Division (mathematics); Component (thermodynamics); Wireless network","score_opus":0.02554156675584694,"score_gpt":0.28040564200895535,"score_spread":0.2548640752531084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03934248,0.0003412086,0.95613277,0.00017035154,0.000058202135,0.000040765004,0.000037178917,0.00027687938,0.0036001657],"genre_scores_gemma":[0.90658426,0.00018939107,0.090893015,0.000073514806,0.00003469101,0.0000453707,0.00004285738,0.000013615533,0.0021232853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.000092668015,0.000014638654,0.00008678431,0.00009458139,0.00006737044],"domain_scores_gemma":[0.9995851,0.00019303442,0.00006908811,0.000058197722,0.00006441286,0.000030102474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039679717,0.0005042802,0.00050093787,0.00018109527,0.00030979543,0.0004971239,0.000690658,0.00053609343,0.00080919085],"category_scores_gemma":[0.0012950104,0.00016476102,0.0002546369,0.00032719353,0.00037201174,0.00058252126,0.0008827569,0.0006591596,0.00019491235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014034072,0.00008904857,0.0019917772,0.00010950895,0.00005010239,0.00023569849,0.00008686912,0.7703956,0.012751015,0.013136613,0.0016816027,0.19933182],"study_design_scores_gemma":[0.000010279691,0.0000731926,0.00019865703,0.0000027968492,0.000006710982,0.000055042303,0.000012129324,0.9951261,0.001457736,0.0019977528,0.0010558919,0.0000037556695],"about_ca_topic_score_codex":0.0036016877,"about_ca_topic_score_gemma":0.004166907,"teacher_disagreement_score":0.0036016877,"about_ca_system_score_codex":0.00031881005,"about_ca_system_score_gemma":0.0007183757,"threshold_uncertainty_score":0.007161498},"labels":[],"label_agreement":null},{"id":"W4414229913","doi":"10.1109/jsac.2025.3610487","title":"Polarforming Antenna Enhanced Sensing and Communication: Modeling and Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Antenna Design 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":"University of Waterloo","funders":"Adelaide Research and Innovation, University of Adelaide; Guangdong Provincial Key Laboratory of Construction Foundation; National Natural Science Foundation of China","keywords":"Transceiver; Antenna diversity; Base station; Wireless; Channel (broadcasting); Exploit; Antenna (radio); Polarization (electrochemistry); Mobile telephony","score_opus":0.01605801447063482,"score_gpt":0.2523390312041879,"score_spread":0.23628101673355306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010269188,0.0006413752,0.9777068,0.00031686816,0.00004171313,0.000037412774,0.00005938115,0.00012379163,0.010803443],"genre_scores_gemma":[0.814899,0.0025068931,0.16606313,0.00028687122,0.00012235122,0.00024063625,0.00020015173,0.00009018379,0.015590777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996389,0.00010381957,0.000008858095,0.00007543453,0.00012920493,0.00004387076],"domain_scores_gemma":[0.999634,0.00018581052,0.00006367417,0.000035745845,0.0000662267,0.000014557262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562513,0.00076325337,0.00059031526,0.00023040565,0.00023454,0.0010597899,0.00080084294,0.0011273796,0.001477359],"category_scores_gemma":[0.0009431437,0.0004499571,0.00042294126,0.00056211464,0.0007811934,0.0010321096,0.0007892505,0.0007843333,0.00058345083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025667903,0.000021730948,0.0003324106,0.000054536544,0.00001205295,0.00005046375,0.000032101747,0.9619341,0.0036901678,0.021052867,0.00075338886,0.012040561],"study_design_scores_gemma":[0.0000018589694,0.000007700857,0.000038834754,0.0000019374222,0.000002125905,0.000012764763,0.000004270493,0.9977174,0.00034076546,0.0013693079,0.0004999304,0.0000032128996],"about_ca_topic_score_codex":0.0024815977,"about_ca_topic_score_gemma":0.0016296189,"teacher_disagreement_score":0.0024815977,"about_ca_system_score_codex":0.00090231386,"about_ca_system_score_gemma":0.0006635474,"threshold_uncertainty_score":0.0065467358},"labels":[],"label_agreement":null},{"id":"W4414229954","doi":"10.1109/jsac.2025.3610448","title":"A Predictive Integrated Sensing, Communication, and Computation Over-the-Air Approach for IoV: Optimization and Trade-Off Analysis","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Science and Technology Innovation Foundation of Harbin; National Natural Science Foundation of China","keywords":"Beamforming; Telecommunications link; Computation; Transmitter power output; Maximization; Optimization problem; Kalman filter; Reliability (semiconductor); Multiplexing","score_opus":0.014914330730351227,"score_gpt":0.27679198130179933,"score_spread":0.2618776505714481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00999672,0.00039438767,0.9862769,0.00013734319,0.000033222856,0.000021443906,0.000012590554,0.000089536596,0.0030378564],"genre_scores_gemma":[0.9009984,0.0007156945,0.09562584,0.00013836051,0.00007472181,0.0001251726,0.000060434228,0.000051577794,0.0022098017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946135,0.00013651625,0.000019000392,0.00009311597,0.00021264855,0.00007736912],"domain_scores_gemma":[0.99946064,0.00031866095,0.000058637583,0.000031462318,0.00010543165,0.000025152312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008341634,0.00095014134,0.00071828236,0.00035997952,0.00038457388,0.00090315763,0.0009065575,0.0007347997,0.0010012086],"category_scores_gemma":[0.0015655465,0.0004484487,0.000452607,0.00062572974,0.00088887184,0.0012268726,0.001109983,0.00091557275,0.00013264507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004025728,0.000020934356,0.00036713164,0.00004084233,0.000018109766,0.00003959654,0.00003545064,0.96540904,0.0021591266,0.0074744015,0.00035398715,0.02404122],"study_design_scores_gemma":[0.0000014238877,0.000012638554,0.00003846659,0.0000015734869,0.000003029021,0.0000051278903,0.000004563573,0.9987349,0.00025683688,0.0008112825,0.00012809181,0.0000021603796],"about_ca_topic_score_codex":0.005791743,"about_ca_topic_score_gemma":0.0045984145,"teacher_disagreement_score":0.005791743,"about_ca_system_score_codex":0.0007139304,"about_ca_system_score_gemma":0.0012458699,"threshold_uncertainty_score":0.011516094},"labels":[],"label_agreement":null},{"id":"W4414431999","doi":"10.1109/jsac.2025.3613283","title":"Cooperative ISAC for Joint Localization and Velocity Estimation in Cell-Free MIMO Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Indoor and Outdoor Localization Technologies","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","funders":"","keywords":"Overhead (engineering); Multiplexing; Encoder; ENCODE; MIMO; Joint (building); Scheme (mathematics); Encoding (memory)","score_opus":0.019902590087579795,"score_gpt":0.26556317377423894,"score_spread":0.24566058368665913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414431999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013104529,0.0001905338,0.985255,0.00008013434,0.000033526467,0.000017677216,0.00002245175,0.000179384,0.0011168084],"genre_scores_gemma":[0.86286557,0.00025432277,0.13312063,0.00018297372,0.00006537663,0.00007331401,0.000112948306,0.000027831129,0.0032969886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992878,0.00016943167,0.000022885146,0.00018502714,0.00022471539,0.000110188645],"domain_scores_gemma":[0.9989692,0.0005112975,0.00010057186,0.00012346967,0.0002506859,0.000044710243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084820646,0.0007524262,0.0007585974,0.00032335264,0.0004234514,0.00063015,0.0012672276,0.000753032,0.0009445552],"category_scores_gemma":[0.0024445632,0.00033225567,0.00037971075,0.00045013725,0.0007177229,0.0010366036,0.0011481242,0.0010010746,0.00030248362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012437308,0.00006278205,0.0011519196,0.000074724725,0.000054952467,0.00014465142,0.00017876363,0.8559451,0.012378287,0.01467387,0.0013625006,0.11384806],"study_design_scores_gemma":[0.0000028568677,0.000024194678,0.000089382505,0.000002128485,0.000003792503,0.000017301514,0.000008740906,0.997389,0.0009227651,0.0012578506,0.00027782054,0.0000041962967],"about_ca_topic_score_codex":0.005982854,"about_ca_topic_score_gemma":0.006068562,"teacher_disagreement_score":0.005982854,"about_ca_system_score_codex":0.0005353742,"about_ca_system_score_gemma":0.0008252547,"threshold_uncertainty_score":0.011896014},"labels":[],"label_agreement":null},{"id":"W4415594190","doi":"10.1109/jsac.2025.3625163","title":"Electromagnetically Reconfigurable Fluid Antenna System for Wireless Communications: Design, Modeling, Algorithm, Fabrication, and Experiment","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Antenna Design and Analysis","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"King Abdullah University of Science and Technology","keywords":"Reconfigurability; Beamforming; Antenna (radio); Channel (broadcasting); Wireless; Reconfigurable antenna; Antenna array; Anechoic chamber; MIMO","score_opus":0.03409388608939518,"score_gpt":0.2840699327724709,"score_spread":0.24997604668307571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415594190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1400009,0.00052198896,0.84858626,0.00050914346,0.0001792695,0.00017522632,0.000102447884,0.001757432,0.008167352],"genre_scores_gemma":[0.6872764,0.00037028495,0.30806604,0.00012904877,0.00004050613,0.00022899029,0.0001151542,0.000066674875,0.0037069323],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996761,0.00007605873,0.000016167203,0.00003796441,0.0001684459,0.000025342551],"domain_scores_gemma":[0.9997137,0.00007365818,0.00006591,0.00004700489,0.0000773657,0.000022394015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036441025,0.00044092725,0.00025916516,0.00026796907,0.00018172748,0.00049117167,0.0005012185,0.00044838505,0.00081638753],"category_scores_gemma":[0.00065427716,0.00015748551,0.00022818665,0.00022840124,0.00033631705,0.00063922984,0.0003441305,0.00029272548,0.00044141445],"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.00033762524,0.0001699491,0.0043120068,0.00039924617,0.00007301902,0.00041177234,0.0003269238,0.18285906,0.61002123,0.02406854,0.0030589132,0.17396167],"study_design_scores_gemma":[0.00006977859,0.0010137897,0.0014931076,0.00003218749,0.0000424932,0.00047198596,0.000087692475,0.611172,0.3517395,0.0016640744,0.03212851,0.00008485912],"about_ca_topic_score_codex":0.00043038602,"about_ca_topic_score_gemma":0.00033505197,"teacher_disagreement_score":0.00081638753,"about_ca_system_score_codex":0.00046215137,"about_ca_system_score_gemma":0.0004729245,"threshold_uncertainty_score":0.003353119},"labels":[],"label_agreement":null},{"id":"W4416650094","doi":"10.1109/jsac.2025.3637022","title":"UAV-Assisted Physical Layer Security for Space–Air–Ground Integrated Networks (SAGIN) With Multiple Eavesdroppers","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"UAV Applications and Optimization","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; Canada Excellence Research Chairs, Government of Canada","keywords":"Physical layer; Artificial noise; Resource allocation; Benchmark (surveying); Secrecy; Optimization problem; Genetic algorithm; Resource management (computing); Power control","score_opus":0.014149483625163954,"score_gpt":0.2650183339333964,"score_spread":0.25086885030823247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0962735,0.00078238745,0.89796275,0.00016695229,0.00005211342,0.000043862183,0.000027545515,0.00013260906,0.0045583323],"genre_scores_gemma":[0.9699388,0.00023101347,0.028793791,0.000037388832,0.000012633933,0.000016385364,0.000015113932,0.000006252443,0.0009485953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996755,0.00012745283,0.00000880517,0.000049703573,0.00007243713,0.000066040484],"domain_scores_gemma":[0.9996427,0.0001667569,0.000068758374,0.0000416157,0.00005300845,0.000027053651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049294863,0.0006923441,0.00041561085,0.0001945874,0.00037278904,0.0006244072,0.0005279668,0.00051550195,0.00054109487],"category_scores_gemma":[0.0007931261,0.00014965935,0.00028204804,0.00023027694,0.0006970758,0.00084470195,0.00093467714,0.00058933685,0.0001003455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097713106,0.000041001407,0.0010708085,0.00007315666,0.000045347868,0.00025509455,0.000080470025,0.9411365,0.010759457,0.0184447,0.000511929,0.027483871],"study_design_scores_gemma":[0.00000443518,0.00006342475,0.00012150783,0.0000043743166,0.000008496268,0.000055116045,0.000020573178,0.9963491,0.0014998234,0.0014917644,0.00037709763,0.0000041593357],"about_ca_topic_score_codex":0.0018998068,"about_ca_topic_score_gemma":0.0030379058,"teacher_disagreement_score":0.0018998068,"about_ca_system_score_codex":0.0005101949,"about_ca_system_score_gemma":0.0005717384,"threshold_uncertainty_score":0.0037774444},"labels":[],"label_agreement":null},{"id":"W4416650133","doi":"10.1109/jsac.2025.3636844","title":"Toward Double-Layer Data Privacy in Communication-Efficient Hierarchical Federated Learning: A Client Sampling Approach","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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":"Simon Fraser University; Carleton University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; Science and Technology Foundation of Shenzhen City","keywords":"Differential privacy; Server; Overhead (engineering); Sampling (signal processing); Cloud computing; Information privacy; Noise (video)","score_opus":0.19043254256584813,"score_gpt":0.3814537212523984,"score_spread":0.19102117868655027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012249997,0.00010887509,0.9859789,0.00040680412,0.000012744937,0.00005934143,0.00006254579,0.00041927298,0.0007015945],"genre_scores_gemma":[0.8161286,0.00020326565,0.17972565,0.0006603933,0.00008246855,0.00029174163,0.00022311955,0.00012188027,0.0025628363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911801,0.0041330904,0.0003527223,0.0015087011,0.0019614166,0.00086397404],"domain_scores_gemma":[0.9815408,0.009907581,0.0011694491,0.0053044762,0.0013635786,0.00071404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0090142675,0.0012757193,0.0020165318,0.00068698317,0.0010760357,0.0024935696,0.00434008,0.0024033983,0.001651662],"category_scores_gemma":[0.026086276,0.0007601159,0.0012222246,0.0013376175,0.0025517219,0.00478556,0.005926193,0.004205176,0.00050499087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080409914,0.0003294862,0.0033322312,0.00019164055,0.00016159267,0.00035649762,0.0004623506,0.7743172,0.0053403857,0.12138958,0.0032308272,0.090084136],"study_design_scores_gemma":[0.00002126895,0.00005037201,0.00009192249,0.000008765656,0.000008450504,0.000056621593,0.000022365024,0.967862,0.0016140941,0.029903056,0.0003522177,0.000008851576],"about_ca_topic_score_codex":0.0018273653,"about_ca_topic_score_gemma":0.0017166834,"teacher_disagreement_score":0.0090142675,"about_ca_system_score_codex":0.0021133057,"about_ca_system_score_gemma":0.0033073085,"threshold_uncertainty_score":0.04767257},"labels":[],"label_agreement":null},{"id":"W4416749880","doi":"10.1109/jsac.2025.3638297","title":"Covert Communication Toward an Aerial Warden in NOMA-Based UAV-MEC Systems","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Western University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Mobile edge computing; Terminal (telecommunication); Wireless; Scheme (mathematics); Block (permutation group theory); Resource allocation; Edge computing; Coordinate descent; Mobile device","score_opus":0.024269729423252586,"score_gpt":0.2879589024647161,"score_spread":0.26368917304146355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416749880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19842346,0.00093987264,0.79334486,0.00043585402,0.00011217857,0.00006329874,0.00008229222,0.0002687595,0.0063294196],"genre_scores_gemma":[0.9823965,0.00015116936,0.016038641,0.000060263923,0.000017082792,0.00003378179,0.000036646543,0.00000745343,0.0012583886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.00011006313,0.00001554357,0.00009762124,0.00009643765,0.00012501841],"domain_scores_gemma":[0.9992125,0.00039140333,0.00013212163,0.000081037295,0.00012395816,0.00005897422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955373,0.0007012215,0.00070383796,0.00023419075,0.00065623113,0.0006480146,0.0008149306,0.0006972931,0.0009119775],"category_scores_gemma":[0.0013604473,0.00021664464,0.0003171536,0.0004048555,0.00064975984,0.00084872625,0.0010329112,0.0005470664,0.00016901271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018788257,0.00004117333,0.0009759315,0.000065962355,0.00003227635,0.00034370765,0.00010418407,0.9488884,0.005736268,0.0050170748,0.0010569931,0.03755004],"study_design_scores_gemma":[0.000004954675,0.000035488963,0.00011960017,0.0000023513023,0.000004151255,0.00003884097,0.000013916113,0.998214,0.00062733935,0.00075492694,0.00018170617,0.0000027235371],"about_ca_topic_score_codex":0.005510926,"about_ca_topic_score_gemma":0.0063626356,"teacher_disagreement_score":0.005510926,"about_ca_system_score_codex":0.0006995638,"about_ca_system_score_gemma":0.000709944,"threshold_uncertainty_score":0.010957718},"labels":[],"label_agreement":null},{"id":"W4416922352","doi":"10.1109/jsac.2025.3639454","title":"Efficient Covert Communication With Ambient OFDM WiFi Backscatter","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security 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 Ottawa","funders":"National Natural Science Foundation of China","keywords":"Backscatter (email); Covert; Transmission (telecommunications); Orthogonal frequency-division multiplexing; Covert channel; Throughput","score_opus":0.012259489735952941,"score_gpt":0.2662666177299913,"score_spread":0.25400712799403835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4047666,0.0010159151,0.5842739,0.00027012627,0.00011895677,0.00007450545,0.000098019016,0.0012109898,0.008171064],"genre_scores_gemma":[0.9411814,0.0003484236,0.055867527,0.000139253,0.00005948252,0.00003938723,0.00007546436,0.000031617397,0.0022574903],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.00006150705,0.000018424631,0.000066074084,0.00019701956,0.000069767244],"domain_scores_gemma":[0.9994461,0.00018262178,0.000116524454,0.00010555215,0.0001286836,0.000020516794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766652,0.00038319716,0.00044051977,0.0003420884,0.00029345535,0.00032929206,0.0003069048,0.00038860235,0.0010772533],"category_scores_gemma":[0.00077621307,0.00013471798,0.00025783773,0.00028089946,0.00028336365,0.0007753537,0.00069383817,0.0002958598,0.00044039966],"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.0006773439,0.00014718549,0.0056232694,0.0003241905,0.000085356834,0.0006843238,0.0002962396,0.015672825,0.6625535,0.0076378207,0.0024233197,0.30387464],"study_design_scores_gemma":[0.00012269824,0.0018318634,0.007316495,0.00006716362,0.0001712924,0.003197093,0.00016544868,0.26687378,0.70123774,0.0034249495,0.015486054,0.000105522224],"about_ca_topic_score_codex":0.0002572381,"about_ca_topic_score_gemma":0.0004302451,"teacher_disagreement_score":0.0010772533,"about_ca_system_score_codex":0.00019806142,"about_ca_system_score_gemma":0.00014456929,"threshold_uncertainty_score":0.003603816},"labels":[],"label_agreement":null},{"id":"W4416922355","doi":"10.1109/jsac.2025.3639463","title":"Satellite–Ground Covert Communications Against an Aerial Warden","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in 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":"Western University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Covert; Jamming; Satellite; Communications satellite; Transmitter power output; Transmission (telecommunications); Power (physics); Covert channel","score_opus":0.052468337546602836,"score_gpt":0.3271910401438486,"score_spread":0.27472270259724574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922355","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.76564884,0.00060135755,0.22081266,0.00031382177,0.000065805056,0.000044447275,0.00008966223,0.00022254072,0.012200862],"genre_scores_gemma":[0.99731016,0.00008068009,0.0021694324,0.000016149565,0.000006188716,0.000004716697,0.000015782565,0.000003358508,0.0003935996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.0001058633,0.0000134793045,0.00007180853,0.00018847048,0.000121353776],"domain_scores_gemma":[0.99898475,0.00041473628,0.000284987,0.000110071014,0.00013973482,0.00006573743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351835,0.0004540793,0.0002946665,0.0005050549,0.00047872736,0.00048463308,0.0005274116,0.0004270831,0.001055661],"category_scores_gemma":[0.0014083299,0.00011774392,0.00027760267,0.00036835534,0.0006686199,0.00059421593,0.00086858746,0.00028341793,0.00018082849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003842456,0.00004480834,0.0070450674,0.00010941103,0.00009148104,0.0013529218,0.00014557276,0.8893435,0.047542825,0.018001469,0.0010118204,0.034926914],"study_design_scores_gemma":[0.000007809929,0.00019881758,0.0031137534,0.0000100102125,0.00003146267,0.00040144278,0.00009244942,0.9835487,0.009695818,0.0020772791,0.00080760533,0.000014889862],"about_ca_topic_score_codex":0.0029731323,"about_ca_topic_score_gemma":0.0029755335,"teacher_disagreement_score":0.0029731323,"about_ca_system_score_codex":0.00066104037,"about_ca_system_score_gemma":0.00042681713,"threshold_uncertainty_score":0.0059116483},"labels":[],"label_agreement":null},{"id":"W4417003545","doi":"10.1109/jsac.2025.3640601","title":"Can Knowledge Improve Security? A Coding-Enhanced Jamming Approach for Semantic Communication","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in 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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Decoding methods; Encryption; Jamming; Channel (broadcasting); Leverage (statistics); Overhead (engineering); Channel state information; Key (lock)","score_opus":0.03879565846859038,"score_gpt":0.31721026805622987,"score_spread":0.27841460958763947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417003545","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.013693933,0.00062608276,0.9761079,0.0022989823,0.00011076404,0.00004484196,0.00004082993,0.00018920303,0.006887443],"genre_scores_gemma":[0.714019,0.0015112702,0.27476624,0.00092277577,0.00027954168,0.00012515536,0.00010509359,0.0001031246,0.0081677735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842095,0.0005584174,0.000065758,0.00025342265,0.00048539726,0.00021610709],"domain_scores_gemma":[0.99489224,0.0025171044,0.0003432278,0.0015174669,0.00057783886,0.00015208447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022137614,0.0007688628,0.0006901392,0.0008700843,0.0009026139,0.00155955,0.0014084982,0.0018083069,0.0025871794],"category_scores_gemma":[0.008985539,0.00037623168,0.00068361603,0.0007693087,0.003116094,0.0060129017,0.0025800045,0.002600725,0.0007277726],"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.0003460917,0.00014101868,0.00071069977,0.00025308563,0.00009353062,0.00027603089,0.00057737646,0.1824586,0.019233353,0.59612757,0.00390851,0.19587427],"study_design_scores_gemma":[0.00004854412,0.00018721951,0.00031281536,0.00008252114,0.000048309368,0.00034977676,0.00016982113,0.6088711,0.0130434325,0.36796257,0.008850145,0.00007371809],"about_ca_topic_score_codex":0.0012981632,"about_ca_topic_score_gemma":0.0013128421,"teacher_disagreement_score":0.0025871794,"about_ca_system_score_codex":0.0011234537,"about_ca_system_score_gemma":0.0015071823,"threshold_uncertainty_score":0.011707604},"labels":[],"label_agreement":null},{"id":"W4417052197","doi":"10.1109/jsac.2025.3641105","title":"RadioDiff- <i>k</i> <sup>2</sup> : Helmholtz Equation Informed Generative Diffusion Model for Multi-Path Aware Radio Map Construction","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Millimeter-Wave Propagation and Modeling","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":"National Key Research and Development Program of China","keywords":"Helmholtz free energy; Helmholtz equation; Gravitational singularity; Inference; Generative model; Partial differential equation; Overhead (engineering); Artificial neural network","score_opus":0.0710374076177685,"score_gpt":0.3092212389395003,"score_spread":0.23818383132173182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417052197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002720477,0.00007552763,0.9951828,0.00010476586,0.00002383248,0.000013844249,0.00003305416,0.00016832325,0.0016773284],"genre_scores_gemma":[0.4553581,0.0006367868,0.5257527,0.0004222696,0.0001227691,0.00025314512,0.0004931997,0.00038770452,0.01657332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997439,0.00006777015,0.000010396556,0.000062803454,0.00008548439,0.000029772278],"domain_scores_gemma":[0.9994276,0.00029727502,0.00005696695,0.000079569065,0.000096839096,0.000041727464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006431224,0.0006535492,0.00057275535,0.0005138627,0.0003550312,0.00096763147,0.0019231205,0.0012591826,0.002791723],"category_scores_gemma":[0.0016669838,0.00050556404,0.0009870051,0.00052316,0.00083334785,0.0012504458,0.0013781742,0.0012876568,0.0009880936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035917412,0.000029779505,0.00053429557,0.000058921094,0.000027696893,0.000091886504,0.000085281026,0.897739,0.003312345,0.06105107,0.0018218227,0.035211977],"study_design_scores_gemma":[0.0000019919728,0.0000049757236,0.000031690895,0.0000019866457,0.0000026069497,0.000022068074,0.0000036133902,0.99269474,0.00040358733,0.005996648,0.00083145674,0.0000046177333],"about_ca_topic_score_codex":0.003417412,"about_ca_topic_score_gemma":0.0030767007,"teacher_disagreement_score":0.003417412,"about_ca_system_score_codex":0.0009940511,"about_ca_system_score_gemma":0.0009451659,"threshold_uncertainty_score":0.009339273},"labels":[],"label_agreement":null},{"id":"W4417143443","doi":"10.1109/jsac.2025.3642235","title":"Task-Specific Trust Evaluation for Multi-Hop Collaborator Selection via GNN-Aided Distributed Agentic AI","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Task (project management); Selection (genetic algorithm); Trustworthiness; Reliability (semiconductor); Graph; Path (computing); Resource (disambiguation); Trust management (information system)","score_opus":0.06629441538138892,"score_gpt":0.3532199016999656,"score_spread":0.2869254863185767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417143443","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.031369112,0.00026068278,0.9652664,0.0001702418,0.000050794257,0.000064730724,0.000037863287,0.0006011097,0.0021791758],"genre_scores_gemma":[0.88977075,0.00013197068,0.10818655,0.000117514915,0.000022251712,0.000098278826,0.00014335518,0.000053945496,0.0014754258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.000280703,0.0000780437,0.00030263222,0.00035952384,0.00015267788],"domain_scores_gemma":[0.99791425,0.0007598912,0.0003055767,0.00024442218,0.00059894944,0.00017681153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013376736,0.0009660711,0.0008975262,0.00071128795,0.0006815705,0.0010333454,0.0018306647,0.000822203,0.00101408],"category_scores_gemma":[0.0047071637,0.00040895806,0.000611546,0.00067227625,0.0006830456,0.0015872297,0.0019027204,0.0011439229,0.00022520516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013734386,0.00007121908,0.002840064,0.000081797894,0.000071932394,0.00016041756,0.00025721095,0.8872765,0.004222121,0.0053671263,0.0011241497,0.09839007],"study_design_scores_gemma":[0.0000049058444,0.000017388651,0.00015401722,0.0000028395427,0.000010493795,0.000015434889,0.000020763693,0.99729925,0.000539829,0.001657727,0.00027269384,0.0000046564737],"about_ca_topic_score_codex":0.011978082,"about_ca_topic_score_gemma":0.014320254,"teacher_disagreement_score":0.011978082,"about_ca_system_score_codex":0.0012722786,"about_ca_system_score_gemma":0.0019506373,"threshold_uncertainty_score":0.023816764},"labels":[],"label_agreement":null},{"id":"W4417471439","doi":"10.1109/jsac.2025.3645754","title":"Tool-Aided Evolutionary LLM for Generative Policy Toward Efficient Resource Management in Wireless Federated Learning","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Privacy-Preserving Technologies in Data","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 Manitoba","funders":"National Key Research and Development Program of China","keywords":"Resource allocation; Benchmark (surveying); Resource management (computing); Wireless; Overhead (engineering); Adaptability; Virtual machine; Server; Selection (genetic algorithm)","score_opus":0.04870686635229451,"score_gpt":0.3353575251678334,"score_spread":0.2866506588155389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417471439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009929878,0.00007626687,0.98815256,0.00015645425,0.000014221559,0.000031622545,0.000024119605,0.0004783632,0.0011365026],"genre_scores_gemma":[0.7268847,0.00013032217,0.26940247,0.00029857625,0.000021648126,0.0002863877,0.00014017028,0.00018573618,0.0026499871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989668,0.00044945566,0.000042984855,0.00019630011,0.0002050466,0.00013933562],"domain_scores_gemma":[0.9983746,0.0010337363,0.000114543465,0.00024096658,0.00014845634,0.000087769935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019816302,0.00093010644,0.0009246873,0.00054606434,0.000590443,0.0012969398,0.0019140835,0.0012675239,0.002372271],"category_scores_gemma":[0.005527681,0.00047881636,0.000886491,0.00044561565,0.0012678921,0.0015836194,0.0027018136,0.0018344267,0.00049442507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003569049,0.000051511088,0.00044595866,0.00003450694,0.000016674581,0.00006707929,0.000078311066,0.951145,0.0010763219,0.01620129,0.00052931305,0.030318413],"study_design_scores_gemma":[0.0000037361522,0.00001135044,0.000015598747,0.000003035825,0.0000021808125,0.000007551136,0.000007642048,0.9929254,0.00032427793,0.0064940727,0.00020315491,0.0000020337257],"about_ca_topic_score_codex":0.0022836155,"about_ca_topic_score_gemma":0.0025372766,"teacher_disagreement_score":0.002372271,"about_ca_system_score_codex":0.0012197759,"about_ca_system_score_gemma":0.0016183156,"threshold_uncertainty_score":0.010479987},"labels":[],"label_agreement":null},{"id":"W7081931631","doi":"10.1109/jsac.2025.3609312","title":"WiCaliper: Simultaneous Material and 3D Size Sensing for Everyday Objects Using WiFi","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Geochemistry and Geologic Mapping","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Standardization; Channel (broadcasting); Property (philosophy); Process (computing); Object (grammar); Function (biology); Quality (philosophy)","score_opus":0.023923781548924338,"score_gpt":0.2907816451172559,"score_spread":0.2668578635683316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081931631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07725971,0.00052858866,0.88711435,0.0002971487,0.00019025753,0.00020876003,0.0010968286,0.021407716,0.011896598],"genre_scores_gemma":[0.54495406,0.00046340685,0.4414129,0.00039830143,0.000121813,0.00031694814,0.0018535396,0.00038553815,0.010093471],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995271,0.00003753119,0.000013762598,0.000115484974,0.0002540557,0.000052059764],"domain_scores_gemma":[0.99971575,0.00006724592,0.000034338816,0.000074859316,0.00007409521,0.00003363125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044160473,0.00088420056,0.00073350716,0.0010870979,0.0003993075,0.0009781902,0.001827835,0.0008469631,0.003097919],"category_scores_gemma":[0.0010826734,0.00031304738,0.00031635034,0.0008064643,0.00043575827,0.0016395022,0.002298383,0.0006013692,0.0010978543],"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.00073557196,0.000272532,0.010697677,0.0003821276,0.00018669575,0.00060143886,0.0005584607,0.023323175,0.15421863,0.012969905,0.030332178,0.7657217],"study_design_scores_gemma":[0.00014994678,0.00054911943,0.008388205,0.000051594765,0.00007864066,0.0010737486,0.00024488542,0.83321816,0.08819907,0.008542468,0.05930967,0.00019446237],"about_ca_topic_score_codex":0.0037762546,"about_ca_topic_score_gemma":0.0073046307,"teacher_disagreement_score":0.0037762546,"about_ca_system_score_codex":0.00047178086,"about_ca_system_score_gemma":0.00056215696,"threshold_uncertainty_score":0.010363579},"labels":[],"label_agreement":null},{"id":"W7083287887","doi":"10.1109/jsac.2025.3614195","title":"How Much Training Is Required for Channel Estimation in Fluid Antenna System?","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Geochemistry and Geologic Mapping","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":"National Research Foundation of Korea","keywords":"Channel state information; Channel (broadcasting); Overhead (engineering); Training (meteorology); Spatial correlation; Wireless; Antenna (radio); Representation (politics); Rank (graph theory)","score_opus":0.05935603263140788,"score_gpt":0.30062831373687804,"score_spread":0.24127228110547017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083287887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018488243,0.00049361686,0.97780114,0.0006876727,0.0000756229,0.000034468045,0.00008161563,0.0003043357,0.0020332637],"genre_scores_gemma":[0.71239245,0.0015048746,0.28214753,0.00047398952,0.00020242734,0.0002072311,0.00033652058,0.00010017583,0.0026347812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890995,0.00035671136,0.000049098595,0.00018493707,0.0003128079,0.00018650881],"domain_scores_gemma":[0.99668604,0.0024761655,0.00021650425,0.00029815306,0.00025027615,0.00007293091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088763784,0.00090067793,0.0008689322,0.00026831956,0.00043398258,0.0006862964,0.0008509511,0.00085776055,0.0025468974],"category_scores_gemma":[0.007033708,0.00037363052,0.0003500678,0.00050945726,0.0011518175,0.0019797923,0.0007642745,0.0015857673,0.0006691164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004784988,0.00011063666,0.0017745675,0.0004607918,0.000058022415,0.0002788898,0.00024826438,0.7688263,0.023023257,0.038183995,0.00406482,0.16249189],"study_design_scores_gemma":[0.000017809449,0.00009193132,0.00058009144,0.00002889469,0.0000147977635,0.00017086926,0.00006133923,0.9830499,0.0057941745,0.008444142,0.0017282035,0.00001791004],"about_ca_topic_score_codex":0.0032792888,"about_ca_topic_score_gemma":0.003339049,"teacher_disagreement_score":0.0032792888,"about_ca_system_score_codex":0.00070313906,"about_ca_system_score_gemma":0.0017012431,"threshold_uncertainty_score":0.008520246},"labels":[],"label_agreement":null},{"id":"W7113900470","doi":"10.1109/jsac.2025.3642218","title":"Covert IRS-UAV Networks Empowered by Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Wireless Communication Technologies","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 Calgary","funders":"","keywords":"Reinforcement learning; Markov decision process; Covert; Benchmark (surveying); Wireless; Transmission (telecommunications); Markov process; Transmitter power output; Channel (broadcasting); Adversary","score_opus":0.013801249551189252,"score_gpt":0.28099499643713993,"score_spread":0.26719374688595066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113900470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061205015,0.00036054678,0.93374413,0.0002419805,0.000044423337,0.00003202862,0.000041395928,0.00030604404,0.004024395],"genre_scores_gemma":[0.96754515,0.00015075476,0.030301677,0.000095359246,0.000017161874,0.000037381807,0.000045554723,0.000019013682,0.0017878667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.00005245202,0.000006650508,0.000055108445,0.0000611117,0.000059112583],"domain_scores_gemma":[0.99947804,0.00024898374,0.000094446,0.000047496545,0.00009252284,0.000038481376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050004525,0.0006134722,0.00060340535,0.00020185095,0.00027203708,0.00050605,0.0009347216,0.00079103804,0.0010713169],"category_scores_gemma":[0.001592321,0.00026667994,0.00028000187,0.00022740994,0.0007533805,0.00085140014,0.0009442888,0.0009148795,0.0001910934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004492886,0.000027350867,0.00045427267,0.0000250849,0.00001377233,0.000058959955,0.000026939544,0.97003704,0.0022179352,0.005202898,0.0004770679,0.021413678],"study_design_scores_gemma":[0.0000019943564,0.00001226405,0.000030474479,0.0000013677278,0.0000015807877,0.000005905584,0.0000023585521,0.9985759,0.00025505995,0.0010224849,0.00008949024,0.000001191189],"about_ca_topic_score_codex":0.004039524,"about_ca_topic_score_gemma":0.004700754,"teacher_disagreement_score":0.004039524,"about_ca_system_score_codex":0.0007928069,"about_ca_system_score_gemma":0.0007396963,"threshold_uncertainty_score":0.008032024},"labels":[],"label_agreement":null},{"id":"W7114793850","doi":"10.1109/jsac.2025.3642840","title":"<i>LAMeTA</i> : Intent-Aware Agentic Network Optimization via a Large AI Model-Empowered Two-Stage Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Software-Defined Networks and 5G","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":"Division of Electrical, Communications and Cyber Systems; Japan Science and Technology Agency; Nanyang Technological University; Ministry of Education, India; Queen's University; Agency for Science, Technology and Research; Queen's University Belfast; National Science Foundation","keywords":"Reinforcement learning; Generative grammar; Enhanced Data Rates for GSM Evolution; Semantics (computer science); Representation (politics); Function (biology); Selection (genetic algorithm); Feature learning","score_opus":0.024479924659919956,"score_gpt":0.2968168859824573,"score_spread":0.2723369613225374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114793850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008838196,0.00024180565,0.9853467,0.00047985627,0.0000470415,0.000041783594,0.00005051439,0.00048544598,0.0044686976],"genre_scores_gemma":[0.5789558,0.0003669404,0.41085073,0.0006805124,0.000097436256,0.0002844501,0.00025263955,0.00035683994,0.008154562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995565,0.0001599904,0.0000180581,0.000083330124,0.00011004256,0.00007197509],"domain_scores_gemma":[0.9991511,0.00047826194,0.00006878304,0.00010309362,0.0001224344,0.000076412296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009189459,0.0009853025,0.00077574945,0.00042235365,0.0005005782,0.0011513326,0.0015166786,0.0010876936,0.003218982],"category_scores_gemma":[0.0022521922,0.0005379495,0.0007674032,0.0004063197,0.00092215335,0.0015735466,0.002318008,0.0021735365,0.0005272434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047237907,0.000060476195,0.00041374157,0.00006686398,0.000036658847,0.00007800077,0.000071141854,0.9328833,0.0020027922,0.026191927,0.0025676123,0.03558029],"study_design_scores_gemma":[0.000003811696,0.000009909178,0.000017907969,0.0000025726029,0.0000033509928,0.000005270625,0.0000049374544,0.9942808,0.00020876573,0.00489071,0.00056939555,0.0000026542207],"about_ca_topic_score_codex":0.0056724222,"about_ca_topic_score_gemma":0.0074189636,"teacher_disagreement_score":0.0056724222,"about_ca_system_score_codex":0.0012751804,"about_ca_system_score_gemma":0.0016078057,"threshold_uncertainty_score":0.011278808},"labels":[],"label_agreement":null},{"id":"W7116957977","doi":"10.1109/jsac.2025.3647416","title":"Low Earth Orbit Satellite (LEOS)-Assisted Integrated Access and Backhauling in xG Wireless Communication: A Generalizable RL Framework","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in 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 Manitoba","funders":"","keywords":"Backhaul (telecommunications); Reinforcement learning; Wireless; Invariant (physics); Base station; Hypergraph; Embedding; Control reconfiguration","score_opus":0.042301112425354455,"score_gpt":0.3236160000703634,"score_spread":0.28131488764500895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116957977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017021712,0.0002684603,0.98076916,0.00027722504,0.000019964866,0.000029164015,0.000027673515,0.00019458304,0.001392007],"genre_scores_gemma":[0.9430468,0.00044206093,0.053229026,0.00017294144,0.000058693302,0.00014191114,0.0000736712,0.00006532019,0.0027695764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939287,0.00021428616,0.000023650118,0.00014863921,0.00011448984,0.00010604556],"domain_scores_gemma":[0.9986609,0.0008588579,0.00017891798,0.00010033508,0.00014879165,0.000052146217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016828313,0.0008911862,0.0010154417,0.00032678296,0.00034064378,0.0009219764,0.0011386225,0.0010564423,0.0009393154],"category_scores_gemma":[0.0036098666,0.00043832022,0.00057152344,0.0003884786,0.0014782513,0.0011133463,0.0011313225,0.0017239725,0.00016052867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011708229,0.000011992457,0.00013611653,0.000011873026,0.000009181949,0.00002152781,0.000015943371,0.9904873,0.00030989718,0.0040141977,0.0001162161,0.004854049],"study_design_scores_gemma":[0.0000022511415,0.00000798198,0.000025921812,0.0000015277492,0.0000021002588,0.0000023473624,0.000001734088,0.99812216,0.00007093307,0.0017009979,0.00006057132,0.0000014731828],"about_ca_topic_score_codex":0.013000897,"about_ca_topic_score_gemma":0.007719754,"teacher_disagreement_score":0.013000897,"about_ca_system_score_codex":0.0013021654,"about_ca_system_score_gemma":0.0015308742,"threshold_uncertainty_score":0.025850475},"labels":[],"label_agreement":null},{"id":"W7117252511","doi":"10.1109/jsac.2025.3648707","title":"6G-Oriented LDPC-Coded Faster-Than-Nyquist Signaling: Code Design and Performance Analysis","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"PAPR reduction in OFDM","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":"Western University","funders":"National Key Research and Development Program of China; Bundesministerium für Bildung und Forschung; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Decoding methods; EXIT chart; Low-density parity-check code; Puncturing; Encoder; Parity bit; Turbo code; Nyquist–Shannon sampling theorem; Information transfer","score_opus":0.033064170096325604,"score_gpt":0.2951678458806846,"score_spread":0.262103675784359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117252511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12509054,0.0009773092,0.86121124,0.0003764946,0.0000452541,0.0001930268,0.0002678177,0.0005068709,0.011331396],"genre_scores_gemma":[0.8838155,0.0008581044,0.11304498,0.00009510029,0.00003410178,0.00013487722,0.00015323507,0.000060287468,0.001803746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990582,0.0002680092,0.000035959605,0.000103490645,0.0004244249,0.000109843044],"domain_scores_gemma":[0.99857056,0.00047095094,0.00029424275,0.00018286437,0.00043522395,0.000046088142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095696654,0.00084494625,0.0004407703,0.0006828578,0.0003344029,0.0010485176,0.0006072402,0.0009267243,0.001257522],"category_scores_gemma":[0.0023381505,0.00020837405,0.00031941576,0.00063698937,0.00070628675,0.00064081245,0.00051057927,0.00071464374,0.00047431682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021672908,0.000068074354,0.0019036588,0.00020941935,0.000060403832,0.0002762653,0.00018041443,0.7969598,0.07924367,0.07760427,0.00081104646,0.042466268],"study_design_scores_gemma":[0.0000061834644,0.00010047379,0.0002985464,0.00001776103,0.000008471104,0.000099930636,0.000012920489,0.9762591,0.018900027,0.0032619985,0.0010152425,0.000019391122],"about_ca_topic_score_codex":0.0025113977,"about_ca_topic_score_gemma":0.002056344,"teacher_disagreement_score":0.0025113977,"about_ca_system_score_codex":0.0014461267,"about_ca_system_score_gemma":0.0012626197,"threshold_uncertainty_score":0.010492444},"labels":[],"label_agreement":null},{"id":"W7117547354","doi":"10.1109/jsac.2025.3649622","title":"On-Device Machine Learning Model Adaptation for 6G Communications: From Standardization to Over-the-Air Prototyping Experiments Based on Beam Prediction","year":2025,"lang":"","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Neural Network Applications","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":"Qualcomm (Canada)","funders":"","keywords":"Standardization; Adaptation (eye); Benchmark (surveying); Inference; Wireless; Process (computing); Rapid prototyping; Data modeling","score_opus":0.058416790810631634,"score_gpt":0.3521063930030678,"score_spread":0.29368960219243617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117547354","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7868498,0.00059538096,0.19708645,0.00069951196,0.0004152273,0.00033810755,0.00039942664,0.0027780794,0.010837896],"genre_scores_gemma":[0.9743663,0.00012037128,0.02372013,0.00012173247,0.00002126153,0.00007721687,0.00022042841,0.000083033025,0.0012695676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.00049896224,0.00006677301,0.00020390202,0.00036229272,0.00019417504],"domain_scores_gemma":[0.9968226,0.0020002073,0.00012212602,0.00058952544,0.00035066568,0.00011481719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019494365,0.00092873466,0.0005567027,0.00027576456,0.00028959042,0.000834122,0.0009960314,0.00078612874,0.0022341434],"category_scores_gemma":[0.0053152847,0.0002167374,0.00043733275,0.00029227705,0.0007263931,0.0010734965,0.0011936466,0.0013961066,0.00054298865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020400868,0.0015016076,0.010081446,0.000582762,0.00025026637,0.0010719078,0.00087881053,0.6444842,0.059715815,0.0066097775,0.007582,0.26520136],"study_design_scores_gemma":[0.00018863588,0.0017094667,0.005778705,0.00004417788,0.00004362082,0.0003469374,0.00030667748,0.9351353,0.048863236,0.0024482254,0.0050731357,0.00006186303],"about_ca_topic_score_codex":0.0035709534,"about_ca_topic_score_gemma":0.0027850445,"teacher_disagreement_score":0.0035709534,"about_ca_system_score_codex":0.00034513554,"about_ca_system_score_gemma":0.00038769175,"threshold_uncertainty_score":0.010309696},"labels":[],"label_agreement":null}]}