{"meta":{"query_hash":"a569ff72713d","filters":{"venue":"2022 IEEE Globecom Workshops (GC Wkshps)"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/a569ff72713d","api":"https://metacan.xera.ac/api/v1/cohort?venue=2022+IEEE+Globecom+Workshops+%28GC+Wkshps%29"},"results":[{"id":"W4315777365","doi":"10.1109/gcwkshps56602.2022.10008786","title":"Performance Analysis of Cell-Free Massive MIMO Systems with Asynchronous Reception","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities","keywords":"Asynchronous communication; MIMO; Orthogonality; Computer science; Telecommunications link; Transmission (telecommunications); Spectral efficiency; Electronic engineering; Channel (broadcasting); Local oscillator; Topology (electrical circuits); Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.005770705817337103,"score_gpt":0.1918678644785714,"score_spread":0.1860971586612343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45368066,0.0018701811,0.52378255,0.00056645303,0.00008544771,0.00007254336,0.0003236807,0.00032914372,0.019289322],"genre_scores_gemma":[0.99416804,0.00028832734,0.004602089,0.000038597052,0.000028520788,0.000019257977,0.000054446195,0.000012338523,0.0007883848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896467,0.0003589777,0.00003320477,0.000111893656,0.00029028568,0.00024091316],"domain_scores_gemma":[0.99638414,0.002125531,0.00045221814,0.00020861265,0.00072632864,0.00010313513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013138402,0.0012562608,0.0006464728,0.0005125756,0.000509066,0.0010550568,0.000581003,0.0008582866,0.0013436549],"category_scores_gemma":[0.004034196,0.00030307108,0.00041668472,0.0006829512,0.0008156644,0.0007832831,0.0009473455,0.000586433,0.00032408282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015234733,0.00003228823,0.0019019524,0.00007742021,0.00004916334,0.00017296901,0.00008831704,0.96958107,0.009047474,0.011867065,0.0003499991,0.006679914],"study_design_scores_gemma":[0.0000054469356,0.00007842746,0.00061708305,0.0000060524994,0.000013369673,0.00005357604,0.000027424157,0.9965815,0.0012142998,0.0012881386,0.000104518935,0.00001020611],"about_ca_topic_score_codex":0.003082351,"about_ca_topic_score_gemma":0.002064452,"teacher_disagreement_score":0.003082351,"about_ca_system_score_codex":0.00096309034,"about_ca_system_score_gemma":0.0008010795,"threshold_uncertainty_score":0.0069877505},"labels":[],"label_agreement":null},{"id":"W4315777415","doi":"10.1109/gcwkshps56602.2022.10008731","title":"Intrusion Detection and Load Balancing using Active Learning Model in SDVNs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Network Security and Intrusion Detection","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":"Brandon University","funders":"Research and Development","keywords":"Computer science; Intrusion detection system; Pooling; Entropy (arrow of time); Machine learning; Artificial intelligence; Network packet; Convergence (economics); Data mining; Computer security","score_opus":0.013298751356416446,"score_gpt":0.23493861550494546,"score_spread":0.22163986414852901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07561354,0.00013747202,0.9212561,0.00022101404,0.000054452627,0.000060078215,0.00005047739,0.00095011864,0.001656613],"genre_scores_gemma":[0.9402569,0.000076110766,0.057759818,0.00008140208,0.00004193906,0.00008221363,0.000094682364,0.00004897827,0.001558047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.00019284843,0.000058391695,0.00017767587,0.00022768781,0.000109923014],"domain_scores_gemma":[0.9986822,0.0006173829,0.00013707229,0.00011350726,0.00036826366,0.00008160743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018015149,0.0006121621,0.0010454297,0.0009203842,0.0004126152,0.0015918291,0.001727268,0.00086601026,0.0011925356],"category_scores_gemma":[0.0029622149,0.00033499673,0.0005941579,0.000620349,0.00075747195,0.0015918822,0.0010752995,0.0009929436,0.00031061436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013501002,0.00012775387,0.0017878539,0.000030024394,0.00004434695,0.00005370901,0.0000811149,0.92773175,0.0032039525,0.0034393638,0.0005477368,0.062817395],"study_design_scores_gemma":[0.0000015457526,0.000007623874,0.00004344742,7.5047143e-7,0.0000016787342,0.0000025013233,0.000001998,0.9990293,0.00035675569,0.00049820833,0.000054871067,0.0000013877382],"about_ca_topic_score_codex":0.00534835,"about_ca_topic_score_gemma":0.0041141002,"teacher_disagreement_score":0.00534835,"about_ca_system_score_codex":0.0011474163,"about_ca_system_score_gemma":0.0009100626,"threshold_uncertainty_score":0.010634422},"labels":[],"label_agreement":null},{"id":"W4315777458","doi":"10.1109/gcwkshps56602.2022.10008738","title":"Power Allocation for a HAPS-Enabled MIMO NOMA System with Spatially Correlated Channels","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"UAV Applications and 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":"Carleton University","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Quality of service; Base station; MIMO; Interference (communication); Spatial correlation; Wireless; Noma; Real-time computing; Telecommunications; Telecommunications link","score_opus":0.005573730909842963,"score_gpt":0.18738457287475693,"score_spread":0.18181084196491398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20015097,0.00083690643,0.7811909,0.0005932382,0.00012111787,0.00013297515,0.00014535543,0.00025950122,0.016569031],"genre_scores_gemma":[0.9752873,0.00018940163,0.021796638,0.00005029376,0.000042555974,0.00005402674,0.00002651516,0.000008240959,0.0025449577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972767,0.000096377305,0.000010826751,0.000051388484,0.00004688435,0.00006685507],"domain_scores_gemma":[0.9997416,0.0001253452,0.00004085808,0.000016411917,0.000050025577,0.000025644795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030823372,0.0005513051,0.00047868496,0.00023345661,0.0005414573,0.00074334687,0.0004548058,0.00038491318,0.002095507],"category_scores_gemma":[0.0006322472,0.00024611174,0.00028202814,0.0004331768,0.0005423173,0.00034805085,0.0006955781,0.00034271547,0.0002858129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002523864,0.00005461696,0.0015793403,0.00011672539,0.00006416012,0.00039021243,0.00014719252,0.9337988,0.0132881785,0.008487362,0.0017435102,0.04007746],"study_design_scores_gemma":[0.000014681398,0.000075227596,0.00038351183,0.0000039375864,0.000016185679,0.000058564965,0.000044479028,0.99722856,0.0007599276,0.0011109842,0.0002979631,0.0000058843907],"about_ca_topic_score_codex":0.0038886357,"about_ca_topic_score_gemma":0.0059963637,"teacher_disagreement_score":0.0038886357,"about_ca_system_score_codex":0.0005649208,"about_ca_system_score_gemma":0.0007222535,"threshold_uncertainty_score":0.0077320337},"labels":[],"label_agreement":null},{"id":"W4315777522","doi":"10.1109/gcwkshps56602.2022.10008645","title":"A Cross-Chain Interoperability Architecture for Smart City Environments","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Blockchain Technology Applications and Security","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":"Lakehead University; Brandon University","funders":"","keywords":"Interoperability; Blockchain; Computer science; Architecture; Cross-platform; Distributed ledger; Software engineering; Data exchange; World Wide Web; Data science; Computer security; Operating system","score_opus":0.012829271796436514,"score_gpt":0.2541002395917334,"score_spread":0.2412709677952969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02514851,0.00027438407,0.94197303,0.001528991,0.00011069216,0.00049481797,0.00012340315,0.006807691,0.023538522],"genre_scores_gemma":[0.50268686,0.00071850396,0.45985067,0.0006101444,0.000088030465,0.00075310987,0.001637333,0.0010909594,0.032564357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972416,0.00082163117,0.00028034073,0.00042188246,0.00081212627,0.00042247507],"domain_scores_gemma":[0.99772745,0.00031837937,0.00014298476,0.00095926935,0.0005281285,0.00032384435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050045894,0.0007094571,0.0005355847,0.0019601246,0.0023221294,0.005947214,0.0023591937,0.0031147597,0.009718319],"category_scores_gemma":[0.0036084051,0.0006845402,0.000910812,0.0016404877,0.0022078552,0.012808528,0.008677942,0.0033380077,0.003401801],"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.0003975721,0.0006412909,0.0032082947,0.0002668082,0.00011013657,0.0013002252,0.0035683415,0.070584744,0.020162836,0.6890384,0.011336246,0.1993851],"study_design_scores_gemma":[0.000086841384,0.00029003082,0.0011783174,0.000231052,0.0000896878,0.00054057984,0.0010301912,0.5013056,0.019357713,0.31042773,0.16532564,0.00013671217],"about_ca_topic_score_codex":0.004638703,"about_ca_topic_score_gemma":0.0037572747,"teacher_disagreement_score":0.009718319,"about_ca_system_score_codex":0.0018133179,"about_ca_system_score_gemma":0.0026759454,"threshold_uncertainty_score":0.032511055},"labels":[],"label_agreement":null},{"id":"W4315777534","doi":"10.1109/gcwkshps56602.2022.10008603","title":"Computation Offloading, UAV Placement, and Resource Allocation in SAGIN","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Server; Resource allocation; Computation; Computation offloading; Bandwidth (computing); Bandwidth allocation; Energy consumption; Cloud computing; Mathematical optimization; Convex optimization; Optimization problem; Linear programming; Enhanced Data Rates for GSM Evolution; Distributed computing; Approximation algorithm; Regular polygon; Edge computing; Computer network; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.007948758898861184,"score_gpt":0.21744059582378322,"score_spread":0.20949183692492204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17179765,0.00043425555,0.8159842,0.00035829312,0.00007926064,0.0000900556,0.00007257692,0.00046264057,0.010721091],"genre_scores_gemma":[0.93750364,0.00018570058,0.059808407,0.00009853195,0.000020259375,0.00006044521,0.00005643265,0.00005386156,0.0022127868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.000091936876,0.000007131297,0.000048600457,0.000050993793,0.00006479218],"domain_scores_gemma":[0.999821,0.00007937161,0.00003199059,0.000018595581,0.000027205759,0.000021914022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029837262,0.0007288755,0.00049510936,0.00020800126,0.00049402885,0.00066395197,0.0005762129,0.0004972092,0.0013839238],"category_scores_gemma":[0.0006018879,0.00021253953,0.0002096423,0.0004025894,0.0005024672,0.00062259834,0.00061709154,0.00043774903,0.00020543973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017005087,0.000097794495,0.0010183796,0.00007739694,0.000017324886,0.0001846015,0.000063203646,0.9449579,0.009221412,0.0046178666,0.0014169994,0.038157087],"study_design_scores_gemma":[0.00000676809,0.000080517864,0.00026409025,0.0000041186063,0.0000048315605,0.000040787585,0.000033853878,0.995564,0.0015386989,0.0015485209,0.0009104009,0.000003476075],"about_ca_topic_score_codex":0.0026704764,"about_ca_topic_score_gemma":0.004888005,"teacher_disagreement_score":0.0026704764,"about_ca_system_score_codex":0.00060545246,"about_ca_system_score_gemma":0.0005767541,"threshold_uncertainty_score":0.00530982},"labels":[],"label_agreement":null},{"id":"W4315777823","doi":"10.1109/gcwkshps56602.2022.10008698","title":"GRAND for Rayleigh Fading Channels","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Decoding methods; Algorithm; Rayleigh fading; Computer science; BCH code; Code (set theory); Multipath propagation; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.019436392833521138,"score_gpt":0.2510370625127393,"score_spread":0.23160066967921814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0630807,0.0072588017,0.8349877,0.0017036336,0.00083485217,0.00022790344,0.0011505143,0.0021537766,0.088602126],"genre_scores_gemma":[0.85780936,0.006689018,0.0998093,0.0009730468,0.00042026764,0.0002499012,0.00089638185,0.00019339897,0.032959264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961853,0.00010747632,0.000010182434,0.000060934817,0.0001132096,0.000089732974],"domain_scores_gemma":[0.9993255,0.00027215327,0.00006413743,0.00013451342,0.00018248781,0.00002128823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041505098,0.00094554835,0.00046556396,0.00031127277,0.0004886064,0.000890016,0.000488913,0.0005784544,0.0073337182],"category_scores_gemma":[0.0020851456,0.00016466631,0.00034630296,0.00045711326,0.00052221783,0.00070892146,0.0007323376,0.0010716327,0.0024091224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027951231,0.00005670663,0.0015022494,0.00043250713,0.00006675419,0.00076759595,0.00010920861,0.5836493,0.01703504,0.2211097,0.031773686,0.14321773],"study_design_scores_gemma":[0.000020797565,0.00012676243,0.00063103216,0.0000512235,0.000023199016,0.000649533,0.00005017189,0.92175585,0.00552375,0.03978242,0.03133834,0.00004693907],"about_ca_topic_score_codex":0.0032117926,"about_ca_topic_score_gemma":0.004145043,"teacher_disagreement_score":0.0073337182,"about_ca_system_score_codex":0.00056177855,"about_ca_system_score_gemma":0.0009110286,"threshold_uncertainty_score":0.024533749},"labels":[],"label_agreement":null},{"id":"W4315783193","doi":"10.1109/gcwkshps56602.2022.10008779","title":"Analytical Method of Physical Layer Authentication for Performance Evaluation","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Eavesdropping; Physical layer; Computer science; Authentication (law); Binary number; Probability density function; Benchmark (surveying); Noise (video); Algorithm; Receiver operating characteristic; Channel (broadcasting); Stability (learning theory); Variance (accounting); Mathematics; Statistics; Artificial intelligence; Machine learning; Computer network; Telecommunications","score_opus":0.03759380676408463,"score_gpt":0.3355786586556045,"score_spread":0.29798485189151985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003259029,0.00077912165,0.9872556,0.00018501826,0.000092630384,0.00010318107,0.00011703114,0.0007996357,0.0074088764],"genre_scores_gemma":[0.5608253,0.004513695,0.42109224,0.0005298801,0.000371817,0.0008372245,0.0005311873,0.00052210654,0.010776587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688256,0.0009751265,0.00014384487,0.00033211606,0.0014373154,0.00022910885],"domain_scores_gemma":[0.99614537,0.0016966806,0.0003262237,0.0006991543,0.0010907858,0.000041717223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334575,0.0019444302,0.000833187,0.0019683365,0.0006809942,0.0016297216,0.0013648038,0.0011578287,0.007932623],"category_scores_gemma":[0.012371159,0.00040072357,0.00077213853,0.0015552108,0.00086761924,0.0026285283,0.0011770547,0.0018509933,0.0027094602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015771904,0.0002091934,0.0016665865,0.0007695909,0.00011565589,0.00037964917,0.00035599354,0.55087256,0.03764557,0.23035918,0.01017645,0.16729191],"study_design_scores_gemma":[0.000008724841,0.000092887625,0.0003577913,0.00005462535,0.000021344033,0.00026745832,0.00005659855,0.97124815,0.007301059,0.014654586,0.005902535,0.00003428678],"about_ca_topic_score_codex":0.0019613113,"about_ca_topic_score_gemma":0.0012283091,"teacher_disagreement_score":0.007932623,"about_ca_system_score_codex":0.0013884796,"about_ca_system_score_gemma":0.0014571637,"threshold_uncertainty_score":0.0265373},"labels":[],"label_agreement":null},{"id":"W4315783207","doi":"10.1109/gcwkshps56602.2022.10008649","title":"Dynamic Unicast-Multicast Scheduling for Age-Optimal Information Dissemination in Vehicular Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unicast; Multicast; Computer science; Computer network; Scheduling (production processes); Distributed computing; Dissemination; Dynamic priority scheduling; Telecommunications; Engineering; Quality of service","score_opus":0.006884346218594665,"score_gpt":0.24788768321301333,"score_spread":0.24100333699441867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07497409,0.0006215756,0.9204327,0.00041756802,0.00006686385,0.000060157123,0.00008838056,0.00015438425,0.0031843837],"genre_scores_gemma":[0.95076835,0.00029518202,0.046533376,0.00006357627,0.00004305759,0.000060704773,0.00007215439,0.00004211571,0.0021214727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00022778362,0.000025727622,0.000116501134,0.00011540617,0.00013597132],"domain_scores_gemma":[0.9985802,0.0008338238,0.00024243901,0.000056920548,0.00017368472,0.00011291925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232077,0.0007858561,0.0011263277,0.0005727928,0.00056751986,0.00084911735,0.0013003375,0.0007037514,0.0009567058],"category_scores_gemma":[0.0040891413,0.00040112121,0.00031218963,0.0006669028,0.00060867344,0.0011074413,0.00094242924,0.0007944309,0.00013936365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055457574,0.000030382913,0.00038779428,0.000033601387,0.000017071558,0.000030558866,0.00004745737,0.9791988,0.00092003733,0.007601305,0.00044943692,0.011228077],"study_design_scores_gemma":[0.0000039701395,0.000016770045,0.000068739806,0.0000018456174,0.0000029111275,0.000007086265,0.000010868067,0.99629444,0.00021382603,0.0031858666,0.00019163806,0.00000205004],"about_ca_topic_score_codex":0.005021107,"about_ca_topic_score_gemma":0.0049124467,"teacher_disagreement_score":0.005021107,"about_ca_system_score_codex":0.0016523973,"about_ca_system_score_gemma":0.0015155085,"threshold_uncertainty_score":0.011989117},"labels":[],"label_agreement":null},{"id":"W4315783220","doi":"10.1109/gcwkshps56602.2022.10008500","title":"Reinforcement Learning Based Congestion Control Mechanism for Opportunistic Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Opportunistic and Delay-Tolerant Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Reinforcement learning; Node (physics); Routing protocol; Network congestion; Latency (audio); Overhead (engineering); Distributed computing; Routing (electronic design automation); Network packet; Artificial intelligence","score_opus":0.020016650652758032,"score_gpt":0.23579036335192052,"score_spread":0.21577371269916248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04374949,0.00026748615,0.95119804,0.00029693384,0.00013297902,0.00012316977,0.00003562681,0.0009127124,0.003283547],"genre_scores_gemma":[0.96677154,0.000078626064,0.031375743,0.00010528176,0.000042042455,0.00010571489,0.000026082309,0.000029603085,0.0014654213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00019369784,0.00004187596,0.00013695548,0.00019157433,0.00011607388],"domain_scores_gemma":[0.99782526,0.0010695095,0.00032634035,0.0001748299,0.00041776005,0.00018628071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508198,0.00056874065,0.00054309994,0.00056552165,0.00075312273,0.0005732813,0.001970251,0.0005382916,0.0012228108],"category_scores_gemma":[0.0039083506,0.00022846462,0.00028067382,0.00030185847,0.00087240874,0.0011923533,0.00086098106,0.00091734325,0.00013779174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031624266,0.00034570452,0.0027633174,0.00014003424,0.00010850107,0.0003599988,0.00032626258,0.79983926,0.012750128,0.05087017,0.003616397,0.12856394],"study_design_scores_gemma":[0.000026733556,0.00005870435,0.00015630909,0.0000043634504,0.0000115915645,0.00004551427,0.0000130801,0.9904931,0.0011416688,0.006892456,0.0011434951,0.000013046152],"about_ca_topic_score_codex":0.0045440835,"about_ca_topic_score_gemma":0.0035840333,"teacher_disagreement_score":0.0045440835,"about_ca_system_score_codex":0.0009987558,"about_ca_system_score_gemma":0.0011252987,"threshold_uncertainty_score":0.009035289},"labels":[],"label_agreement":null},{"id":"W4315783264","doi":"10.1109/gcwkshps56602.2022.10008789","title":"Beyond-Cell Communications via HAPS-RIS","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Computer network; Base station; Cellular network; Transmitter power output; Service (business); Telecommunications; Transmitter","score_opus":0.012513267675419475,"score_gpt":0.23247905410592734,"score_spread":0.21996578643050788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34266728,0.0005215442,0.6163632,0.00029441292,0.0001780654,0.00010670518,0.00019277712,0.0010086312,0.03866733],"genre_scores_gemma":[0.97017944,0.000103781735,0.026541295,0.00006147317,0.000036210728,0.000028540713,0.00007121755,0.000009358546,0.0029685802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975175,0.000059873386,0.0000074667387,0.000050252307,0.000063990374,0.00006658174],"domain_scores_gemma":[0.9997509,0.00008751355,0.000035669447,0.00005210803,0.00004380368,0.000029960245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001975552,0.0005442034,0.00038951513,0.00019498095,0.0003106099,0.00063661666,0.00062076683,0.00040831472,0.0025272064],"category_scores_gemma":[0.00042546238,0.00012870228,0.0002370137,0.00031714514,0.00042368134,0.00060456386,0.0012016207,0.00045025334,0.0005974268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054605416,0.0001548662,0.0075137503,0.00022848636,0.00013829657,0.001481019,0.0005017182,0.69361466,0.081939064,0.033003163,0.005264532,0.1756145],"study_design_scores_gemma":[0.000028961147,0.0004357822,0.0016356481,0.000013649836,0.000040845036,0.00036450848,0.00020659826,0.9752109,0.0101835495,0.0053795683,0.0064785383,0.000021501317],"about_ca_topic_score_codex":0.0015512599,"about_ca_topic_score_gemma":0.0026155119,"teacher_disagreement_score":0.0025272064,"about_ca_system_score_codex":0.00023789622,"about_ca_system_score_gemma":0.00041362437,"threshold_uncertainty_score":0.008454323},"labels":[],"label_agreement":null},{"id":"W4315783319","doi":"10.1109/gcwkshps56602.2022.10008501","title":"Minimum Union Bound Symbol Error Probability Precoding for PSK Modulation and Phase Quantization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","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 Manitoba","funders":"Agence Nationale de la Recherche","keywords":"Precoding; Phase-shift keying; Quantization (signal processing); Algorithm; MIMO; Modulation (music); Mathematics; Probability of error; Computer science; Minification; Symbol (formal); Bit error rate; Upper and lower bounds; Mathematical optimization; Decoding methods; Telecommunications; Channel (broadcasting)","score_opus":0.025305675238678778,"score_gpt":0.2752554984521729,"score_spread":0.24994982321349413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023308345,0.00037248808,0.99468154,0.00011170371,0.00002919857,0.000016091324,0.000028211785,0.00004227782,0.0023876268],"genre_scores_gemma":[0.5200558,0.0026047074,0.4646417,0.00028084998,0.00025819038,0.0003839658,0.00029003804,0.00014839611,0.011336301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804115,0.0006732685,0.000066624445,0.00017508799,0.0009135322,0.00013032857],"domain_scores_gemma":[0.99759537,0.0016661913,0.00016140517,0.0001556354,0.0003795897,0.00004185168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023545,0.0008430439,0.0012934863,0.00040217128,0.00033935095,0.0016692479,0.0008594897,0.0010325197,0.0027086071],"category_scores_gemma":[0.0061843153,0.00040713703,0.0004164119,0.0012266822,0.0010971684,0.0015162525,0.0012635841,0.0014120915,0.00072064745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009211296,0.00005603545,0.00018979215,0.00021922869,0.00004044559,0.00008153397,0.00008906083,0.78919864,0.0041859313,0.14608748,0.002573898,0.057185818],"study_design_scores_gemma":[0.000007635869,0.000030855663,0.000050724484,0.000016117172,0.000004989097,0.000030787498,0.000008131202,0.97921926,0.0012603296,0.018368892,0.0009956849,0.0000065394643],"about_ca_topic_score_codex":0.001291139,"about_ca_topic_score_gemma":0.0011347613,"teacher_disagreement_score":0.0027086071,"about_ca_system_score_codex":0.001056096,"about_ca_system_score_gemma":0.0016203352,"threshold_uncertainty_score":0.009061217},"labels":[],"label_agreement":null},{"id":"W4315783372","doi":"10.1109/gcwkshps56602.2022.10008694","title":"Heuristic Distribution of Latency-Sensitive Tasks in Multi-Access Edge Computing Systems","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; European Commission; Canadian Institute for Theoretical Astrophysics","keywords":"Computer science; Distributed computing; Heuristics; Latency (audio); Edge computing; Quality of service; Computer network; Server; The Internet; Mobile edge computing; Integer programming; Enhanced Data Rates for GSM Evolution; Operating system","score_opus":0.030199135273683984,"score_gpt":0.2806487707555799,"score_spread":0.2504496354818959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33041823,0.0010703676,0.66231984,0.00045050235,0.00010052556,0.00023607776,0.00011570641,0.0003923832,0.004896462],"genre_scores_gemma":[0.9551902,0.00014478243,0.04364069,0.000057495858,0.000013881063,0.00005001982,0.000048630158,0.00002923334,0.0008251236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994956,0.00017014983,0.00002312642,0.000066518674,0.00007230057,0.00017226093],"domain_scores_gemma":[0.99877995,0.00074502465,0.000115521754,0.00006162477,0.00012202344,0.00017590556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117939,0.0007301658,0.00084429915,0.0006038682,0.0005730584,0.00088701316,0.0011759783,0.00070287805,0.0013038614],"category_scores_gemma":[0.0024745173,0.00040694885,0.00028485368,0.0005651041,0.0005284278,0.0007977119,0.00083059096,0.0005153791,0.00013292667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015297392,0.000045785164,0.000464124,0.000038795344,0.00001127082,0.00006532106,0.000033667427,0.98500836,0.0013496459,0.0021706482,0.00042574838,0.010233647],"study_design_scores_gemma":[0.000011314288,0.000029586681,0.00007527419,0.0000023457044,0.0000027357844,0.000009642459,0.000018626875,0.99846125,0.00028879364,0.0009817003,0.00011656194,0.000002183622],"about_ca_topic_score_codex":0.005575593,"about_ca_topic_score_gemma":0.0049899085,"teacher_disagreement_score":0.005575593,"about_ca_system_score_codex":0.0013067481,"about_ca_system_score_gemma":0.0013189461,"threshold_uncertainty_score":0.011086285},"labels":[],"label_agreement":null}]}