{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536488,0.0020765176,0.4287607,0.000048248938,0.0032727465,0.0014630631,0.0004502946,0.00085248094,0.009427101],"genre_scores_gemma":[0.9950968,0.00023420002,0.003013863,0.000014710575,0.00012509809,0.0003990854,0.0002541769,0.000101871265,0.0007601678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.00014875593,0.00070357387,0.00047452684,0.0005919514,0.00048938266],"domain_scores_gemma":[0.9982439,0.000101619116,0.00035486877,0.0010516006,0.00013177095,0.000116238974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030657934,0.00037321556,0.0007128455,0.00063887914,0.00027766015,0.00004530381,0.0006074904,0.00011621777,0.00052689295],"category_scores_gemma":[0.00001592121,0.00039814098,0.00017507073,0.0033266502,0.000052581847,0.0003314785,0.00013476337,0.00045047366,0.000020735197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006265671,0.00006434256,0.0022545746,0.00019065727,0.0005756253,0.000010950349,0.00044994592,0.9904757,0.0019184655,0.000029669332,0.0030158085,0.000951597],"study_design_scores_gemma":[0.0008313334,0.00017471984,0.00108093,0.000067011635,0.0006898545,0.000016782007,0.0019984671,0.9927986,0.0008188573,0.0000049501996,0.0009820675,0.0005363753],"about_ca_topic_score_codex":0.000056990033,"about_ca_topic_score_gemma":0.000074786294,"teacher_disagreement_score":0.44144797,"about_ca_system_score_codex":0.0008067891,"about_ca_system_score_gemma":0.000051458825,"threshold_uncertainty_score":0.99984705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70685124,0.00030245687,0.29016036,0.00019751005,0.0014034505,0.0002988196,0.0000039441197,0.00022814427,0.000554057],"genre_scores_gemma":[0.9965417,0.00012114736,0.002641402,0.00027276576,0.00016333796,0.000057216555,0.0000037029447,0.00002641369,0.00017231342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710745,0.00044269106,0.00042510912,0.0008019219,0.000667782,0.0005550562],"domain_scores_gemma":[0.9990247,0.0001399658,0.00023321573,0.00040339146,0.00006850048,0.000130215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010083081,0.0002732388,0.0003133626,0.00035758477,0.0012454441,0.00017976585,0.00052857056,0.00013433804,0.00011100641],"category_scores_gemma":[0.00007696907,0.00032478763,0.00009230341,0.0016713059,0.00004648312,0.0009037226,0.0010058512,0.0014448278,0.000008396257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013436428,0.0000906913,0.000250689,0.000014288364,0.000016883903,0.000035191664,0.0032271543,0.754381,0.015471541,0.0005047953,0.00018044899,0.22569297],"study_design_scores_gemma":[0.00058456487,0.00012310757,0.00035554304,0.00003905877,0.000010581426,0.00010748882,0.00063097477,0.99168,0.001554765,0.002598518,0.0019586892,0.00035665857],"about_ca_topic_score_codex":0.00030661726,"about_ca_topic_score_gemma":0.00066646887,"teacher_disagreement_score":0.28969043,"about_ca_system_score_codex":0.0010916356,"about_ca_system_score_gemma":0.00014166569,"threshold_uncertainty_score":0.9999204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07543768,0.0004812195,0.91014177,0.00040982527,0.002832833,0.0028598679,0.00019898538,0.001431979,0.006205824],"genre_scores_gemma":[0.99151784,0.000016596257,0.0037998725,0.00010229569,0.00016414816,0.0024689604,0.00048840296,0.00013453334,0.0013073569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998184,0.00005941905,0.0004663283,0.00045681433,0.00035565344,0.0004777517],"domain_scores_gemma":[0.9989262,0.00009447561,0.0001472788,0.000551828,0.00015363627,0.00012655821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003264597,0.00032425945,0.00033511175,0.00019477821,0.00053335243,0.00012033357,0.0003773534,0.00012972389,0.00058254733],"category_scores_gemma":[0.000011835069,0.00034392715,0.00010555931,0.001030802,0.000026830467,0.00019130587,0.000061807536,0.00032660813,0.000044617438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001198119,0.00008861747,0.00009065078,0.000083460836,0.00013402646,0.0000071269183,0.00042338218,0.9751913,0.00056147325,0.0016431314,0.020638572,0.0010184752],"study_design_scores_gemma":[0.0013065247,0.0001635444,0.00015745922,0.000053427364,0.00007937023,0.0000421622,0.00081677333,0.9781694,0.0003201184,0.000046111603,0.0183494,0.00049574405],"about_ca_topic_score_codex":0.000051832027,"about_ca_topic_score_gemma":0.00006450788,"teacher_disagreement_score":0.9160802,"about_ca_system_score_codex":0.00055535184,"about_ca_system_score_gemma":0.000073283314,"threshold_uncertainty_score":0.9999013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3328482,0.00025171324,0.6586225,0.0051280917,0.0010258264,0.0011695649,0.00015473239,0.00044186044,0.0003575227],"genre_scores_gemma":[0.98014104,0.000014053615,0.014764878,0.0014675688,0.000096691896,0.0020011428,0.000043233413,0.00003136233,0.0014400238],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968388,0.00022299141,0.00052775076,0.0012408561,0.0004655313,0.00070406497],"domain_scores_gemma":[0.9973421,0.00025354093,0.00020187674,0.0020043214,0.00003815306,0.0001600252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012557632,0.00034685346,0.00038460948,0.0001769622,0.0012982084,0.0001655541,0.002873777,0.00019571024,0.00048207399],"category_scores_gemma":[0.000078784884,0.0003645534,0.00027598924,0.00084289233,0.0002818543,0.00016729195,0.0016909774,0.0010719242,0.00003106364],"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.00063315575,0.005781917,0.04873932,0.00016898924,0.0006242314,0.000097975615,0.006825007,0.033444334,0.0069604274,0.14697522,0.0682144,0.681535],"study_design_scores_gemma":[0.0028626462,0.00065428595,0.013171103,0.000020713105,0.00004988198,0.00017913317,0.00038985882,0.13019846,0.0036002493,0.12469767,0.72253,0.0016459672],"about_ca_topic_score_codex":0.00006195249,"about_ca_topic_score_gemma":0.000080547725,"teacher_disagreement_score":0.679889,"about_ca_system_score_codex":0.0003685429,"about_ca_system_score_gemma":0.00007020242,"threshold_uncertainty_score":0.9998807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72414047,0.0020449464,0.25424445,0.0011415734,0.0011451917,0.0016141727,0.000083906016,0.00091339555,0.014671879],"genre_scores_gemma":[0.99595714,0.00012607577,0.002517768,0.00017615095,0.00008247674,0.00031743463,0.00028763872,0.00004922715,0.00048607154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877065,0.000077229684,0.00033819737,0.00030595,0.00024256014,0.00026543622],"domain_scores_gemma":[0.9995505,0.00007156311,0.00006628514,0.0002226163,0.000020741576,0.000068276786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547405,0.00017409971,0.00016841904,0.00023254385,0.00023264412,0.00006710218,0.0001637378,0.000066812354,0.00027066513],"category_scores_gemma":[0.000009909361,0.00022536653,0.0000315515,0.0008351377,0.000024295505,0.0001396389,0.00008100405,0.00033524906,0.000018182263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015180833,0.0000480374,0.0011306971,0.000020152624,0.00001615896,0.0000022399388,0.0006323973,0.9637674,0.0004239639,0.00034060972,0.022331908,0.011271246],"study_design_scores_gemma":[0.0007330488,0.00003268873,0.0036264185,0.000018878864,0.000019164625,0.000011843771,0.0011713429,0.9606738,0.00013094525,0.00023826791,0.03302539,0.00031818703],"about_ca_topic_score_codex":0.00003506907,"about_ca_topic_score_gemma":0.000089033485,"teacher_disagreement_score":0.27181667,"about_ca_system_score_codex":0.00033387833,"about_ca_system_score_gemma":0.000018037625,"threshold_uncertainty_score":0.91901803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47650778,0.015319533,0.41893497,0.004918867,0.018161068,0.008168331,0.001390353,0.016531259,0.040067844],"genre_scores_gemma":[0.99257034,0.0002738162,0.003637372,0.0003031589,0.0002844232,0.0018962716,0.00014867737,0.00014342103,0.0007425392],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979712,0.0001293388,0.00050291035,0.00038726645,0.00040220693,0.00060707727],"domain_scores_gemma":[0.9983755,0.0003307501,0.000099576115,0.0009949678,0.00006222434,0.00013698591],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006822698,0.00033835857,0.0004234286,0.00027397624,0.00065791485,0.000119112236,0.0011653942,0.0001278437,0.00092401827],"category_scores_gemma":[0.000041586747,0.0004242081,0.00024143596,0.00075634685,0.000052818647,0.0002324643,0.00032303494,0.0007321977,0.000025913016],"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.00013771122,0.00029082832,0.00026546564,0.00026139047,0.000343583,0.000026082815,0.0042436225,0.17123784,0.008666484,0.0074432134,0.7680881,0.038995665],"study_design_scores_gemma":[0.0015490954,0.00013719071,0.000090267975,0.00007375258,0.00007387075,0.00005418829,0.0009414712,0.24119388,0.014157539,0.0072285356,0.73319864,0.0013015607],"about_ca_topic_score_codex":0.000016288315,"about_ca_topic_score_gemma":0.000024572524,"teacher_disagreement_score":0.51606256,"about_ca_system_score_codex":0.0003840528,"about_ca_system_score_gemma":0.000028744616,"threshold_uncertainty_score":0.9999893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7750244,0.0004271857,0.21696326,0.00054534164,0.0006359147,0.0018767776,0.00014484323,0.0008174828,0.0035647752],"genre_scores_gemma":[0.98653185,0.000038589806,0.011856627,0.000045684963,0.00010127441,0.0011325665,0.00013423503,0.000052693624,0.000106470754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998082,0.00025968775,0.00044886852,0.00027412624,0.00065276824,0.00028255332],"domain_scores_gemma":[0.9984047,0.0003966032,0.00012817731,0.0008242276,0.00018082162,0.00006547552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015374334,0.00019646493,0.00033595396,0.00019788857,0.00020491667,0.000026702286,0.0006279237,0.00007608281,0.00034946227],"category_scores_gemma":[0.00008198382,0.00022983865,0.00018496937,0.0006848519,0.0000470039,0.00018428429,0.00015422014,0.00041258932,0.000010583123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017101785,0.0008348183,0.00084963714,0.00031769695,0.00038081474,8.722742e-7,0.0048210686,0.55047613,0.029084632,0.021094127,0.032980986,0.3589882],"study_design_scores_gemma":[0.00037629882,0.00008275448,0.00089833396,0.000019126748,0.000111777896,0.0000040889813,0.0002287099,0.976394,0.012678853,0.0012081879,0.0077667786,0.0002310817],"about_ca_topic_score_codex":0.000006567894,"about_ca_topic_score_gemma":0.0000048031334,"teacher_disagreement_score":0.42591786,"about_ca_system_score_codex":0.00034961614,"about_ca_system_score_gemma":0.00005310663,"threshold_uncertainty_score":0.9372548},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898123,0.000107929234,0.9765775,0.0012150005,0.0012664244,0.0010590734,0.000026733283,0.00028501876,0.0004810986],"genre_scores_gemma":[0.8092129,0.000051404117,0.18824683,0.00075315,0.00006521329,0.0006505554,0.00075521384,0.00003246618,0.00023220961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997084,0.00017547027,0.000985451,0.00042626337,0.0007041903,0.00062459015],"domain_scores_gemma":[0.99810255,0.00032594867,0.00050397747,0.0007286828,0.00020546277,0.00013338857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369861,0.000314954,0.00032411818,0.00057133357,0.0006694464,0.00050367584,0.0013355393,0.00015724177,0.00010156388],"category_scores_gemma":[0.00023033678,0.0003735196,0.00016149633,0.0018698282,0.00004877701,0.0036743968,0.0005797012,0.0006241046,0.00003187615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004387676,0.00007525398,0.000061027604,0.00002579416,0.000016904343,0.000010511123,0.0013983648,0.9577018,0.000024031995,0.003181882,0.0016113372,0.035849225],"study_design_scores_gemma":[0.0009017914,0.000082330174,0.000602401,0.000047651916,0.000012536449,0.000026978849,0.0010446112,0.9930294,0.000022874772,0.00016512256,0.0036589303,0.00040533178],"about_ca_topic_score_codex":0.00001111708,"about_ca_topic_score_gemma":0.000022601787,"teacher_disagreement_score":0.7902317,"about_ca_system_score_codex":0.0008137221,"about_ca_system_score_gemma":0.00010818985,"threshold_uncertainty_score":0.9998717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002114249,0.00014701045,0.98904103,0.0018927432,0.004878197,0.0013742489,0.000043247433,0.00059550436,0.0018165641],"genre_scores_gemma":[0.98334616,0.00004918158,0.0050380295,0.0055239853,0.00054164964,0.0011414931,0.0003549749,0.000074746225,0.0039297943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514407,0.00048633863,0.000977661,0.0011350262,0.001012638,0.0012442416],"domain_scores_gemma":[0.9965249,0.0010045089,0.0006272499,0.0010811884,0.00026524052,0.00049696834],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001961623,0.0005621697,0.00070101593,0.00025016605,0.0018071567,0.00037214212,0.0016182263,0.00022044475,0.00077487004],"category_scores_gemma":[0.000060217197,0.0006306829,0.00038548684,0.00083975197,0.00008538273,0.0003449039,0.00042756693,0.0011357681,0.000027088525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026708192,0.00016125098,0.000079911486,0.000027963115,0.000116770796,0.00016309574,0.00010484395,0.8168215,0.000043327847,0.10366441,0.031391438,0.047158383],"study_design_scores_gemma":[0.0026859762,0.00059511466,0.000019063353,0.00003865558,0.000112315975,0.000052736177,0.00014865761,0.9738105,0.000009087879,0.0033996277,0.018418757,0.00070950564],"about_ca_topic_score_codex":0.000030315385,"about_ca_topic_score_gemma":0.000009946755,"teacher_disagreement_score":0.984003,"about_ca_system_score_codex":0.0004336274,"about_ca_system_score_gemma":0.00042192108,"threshold_uncertainty_score":0.9996145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09598626,0.076103926,0.561252,0.014452148,0.009135388,0.004104645,0.0010855352,0.028592957,0.20928714],"genre_scores_gemma":[0.9787415,0.002737162,0.0154695995,0.0003467125,0.000057126468,0.00092908373,0.00021425507,0.0001436943,0.0013608616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976913,0.00019528273,0.000620234,0.00041213396,0.00045779982,0.0006232857],"domain_scores_gemma":[0.99489987,0.0003721336,0.00016311847,0.00437918,0.0000636137,0.00012206137],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035556772,0.00039648337,0.00041596044,0.00032426722,0.0010327302,0.000069709335,0.0038922725,0.00016683714,0.0011195041],"category_scores_gemma":[0.00004158363,0.0005004321,0.00018825926,0.0015421115,0.00023554343,0.00029264283,0.0018572317,0.0017610259,0.0002782053],"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.000030042533,0.00055260095,0.0007211661,0.00007881332,0.00018856602,0.00002417375,0.0011017867,0.66004694,0.014857833,0.006895521,0.15291531,0.16258726],"study_design_scores_gemma":[0.001550481,0.00013398597,0.0004770058,0.000038688075,0.00008345359,0.00007874867,0.0056333872,0.31324536,0.011275501,0.017527888,0.64797044,0.0019850722],"about_ca_topic_score_codex":0.000030824413,"about_ca_topic_score_gemma":0.00008376605,"teacher_disagreement_score":0.8827552,"about_ca_system_score_codex":0.0005873873,"about_ca_system_score_gemma":0.000038107533,"threshold_uncertainty_score":0.9997936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29385266,0.00039575621,0.70093393,0.0001134921,0.0018961225,0.0019623842,0.00014910061,0.0004998297,0.00019673492],"genre_scores_gemma":[0.9897011,0.00004382756,0.0082668,0.000029798755,0.00021274551,0.0008469128,0.00048738573,0.00010382077,0.0003075996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979513,0.00017538601,0.00061735447,0.0005523314,0.0002736917,0.00042988211],"domain_scores_gemma":[0.9990117,0.00017442009,0.00018150583,0.0004200516,0.00009936278,0.00011298468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073474215,0.00031564408,0.0003549121,0.00019517714,0.0005738744,0.00010235357,0.00019444813,0.00012657567,0.00012177664],"category_scores_gemma":[0.000108229964,0.0003925299,0.00009162302,0.00065143907,0.000040553732,0.00055694266,0.00008072992,0.0002726094,0.000004027268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008653803,0.00011773447,0.00046418476,0.00023299718,0.00004564631,0.0000014008614,0.0006428783,0.97537154,0.0066017318,0.0003651203,0.0020336825,0.014036571],"study_design_scores_gemma":[0.0017294709,0.0001224868,0.00021337376,0.000043805063,0.000048939477,0.000014803374,0.0005862758,0.9923608,0.0005736747,0.001561585,0.0023093477,0.00043544275],"about_ca_topic_score_codex":0.00001184453,"about_ca_topic_score_gemma":0.00005181365,"teacher_disagreement_score":0.69584846,"about_ca_system_score_codex":0.00057660096,"about_ca_system_score_gemma":0.00003627607,"threshold_uncertainty_score":0.99985266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38153538,0.0006400381,0.58912843,0.00031554746,0.026693877,0.00075298833,0.000036969064,0.00032692985,0.000569876],"genre_scores_gemma":[0.9976574,0.000013428831,0.0012215774,0.00012590244,0.0006448577,0.000036752608,0.00010721093,0.00003161872,0.00016123001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956445,0.0007028186,0.0010496624,0.0009436951,0.000744301,0.0009150314],"domain_scores_gemma":[0.9977261,0.00051519735,0.000569762,0.000836752,0.0001889749,0.00016321086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015738416,0.00039694217,0.0006919456,0.00031273882,0.0006630622,0.00029983054,0.0019944948,0.00012634939,0.000010298761],"category_scores_gemma":[0.00013989871,0.0004519792,0.00019479632,0.002554284,0.000095420444,0.00046832472,0.0020193593,0.00091189024,0.000024150224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022053327,0.0024764822,0.05006794,0.0006361198,0.00032542588,0.0015860632,0.010533469,0.76576453,0.0015559271,0.008070841,0.095569365,0.0631933],"study_design_scores_gemma":[0.0010072992,0.000098915974,0.026623799,0.00018441025,0.00002101172,0.00010714777,0.0003950512,0.9678374,0.00023734446,0.00019224836,0.0026868863,0.00060847437],"about_ca_topic_score_codex":0.0008125303,"about_ca_topic_score_gemma":0.000021623415,"teacher_disagreement_score":0.61612207,"about_ca_system_score_codex":0.000680176,"about_ca_system_score_gemma":0.00019304328,"threshold_uncertainty_score":0.9997932},"labels":[],"label_agreement":null}]}