{"meta":{"query_hash":"364f5a8b1d41","filters":{"venue":"Globecom"},"cohort_total":100,"direct_labels_cover":0,"predictions_cover":100,"exported":100,"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/364f5a8b1d41","api":"https://metacan.xera.ac/api/v1/cohort?venue=Globecom"},"results":[{"id":"W1963622137","doi":"10.1109/glocom.2006.882","title":"WLC45-6: A Family of Low Complexity Adaptive Binary Linear Block Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Linear code; Concatenated error correction code; Hamming code; Algorithm; Mathematics; Turbo code; Expander code; Cyclic code; Computer science; Theoretical computer science; Decoding methods","score_opus":0.023263842875162977,"score_gpt":0.24859833233207118,"score_spread":0.2253344894569082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963622137","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.034673586,0.0022309422,0.946774,0.00025057825,0.00012660911,0.00024915638,0.0008050748,0.00109291,0.013797126],"genre_scores_gemma":[0.4120769,0.0022613634,0.55935943,0.00039066598,0.000103296814,0.00060767174,0.0024789649,0.0002140723,0.022507576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.00011956415,0.000033377935,0.00007042757,0.00026865295,0.00008218222],"domain_scores_gemma":[0.9990282,0.00022586777,0.00015793546,0.00015970695,0.0003608675,0.0000674207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529491,0.000558129,0.00046923765,0.0010916902,0.00039685523,0.0008345338,0.0008183721,0.00065686065,0.0023004124],"category_scores_gemma":[0.0022342072,0.00016789959,0.0002845117,0.0012562273,0.000501326,0.00063742016,0.00059315894,0.00073252426,0.0017251915],"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.0005404131,0.00012298854,0.002220485,0.00039079486,0.00007036042,0.0004212434,0.00015976213,0.13401446,0.05997654,0.17968751,0.015064539,0.6073309],"study_design_scores_gemma":[0.000112905764,0.00048786012,0.001614411,0.00010716916,0.00004718963,0.0012849639,0.00004652937,0.7873244,0.045793004,0.05233313,0.1107238,0.00012458272],"about_ca_topic_score_codex":0.0017111283,"about_ca_topic_score_gemma":0.0019673186,"teacher_disagreement_score":0.0023004124,"about_ca_system_score_codex":0.000558756,"about_ca_system_score_gemma":0.0010225022,"threshold_uncertainty_score":0.0076956153},"labels":[],"label_agreement":null},{"id":"W1968732129","doi":"10.1109/glocom.2006.748","title":"WLC23-4: Performance Enhancement of Medium Access Control for UWB WPAN","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Personal area network; Distributed computing; Wireless; Schedule; Access control; Wireless network; Computation; Power control; Network topology; Heuristic; Power (physics); Engineering; Telecommunications; Algorithm","score_opus":0.008378572416027385,"score_gpt":0.22922027241461856,"score_spread":0.22084169999859118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968732129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24610534,0.0023454148,0.72822815,0.00044683373,0.0003726652,0.00013547733,0.000075613825,0.0026916985,0.019598816],"genre_scores_gemma":[0.93280685,0.0003321891,0.06504948,0.00007126109,0.0000686115,0.0000512927,0.00006995306,0.00005231259,0.0014980955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954283,0.000114954964,0.00002208013,0.00004905105,0.00017943874,0.000091682865],"domain_scores_gemma":[0.99925154,0.000320093,0.00007166216,0.000099501776,0.00022028787,0.000036922935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080518273,0.00039547807,0.00038652137,0.0004389809,0.0003855796,0.0005444016,0.0005816862,0.00043169077,0.0014261879],"category_scores_gemma":[0.0023109359,0.00007981826,0.00018042342,0.00040475707,0.000260345,0.00042217373,0.00037063018,0.0004668623,0.00036541303],"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.00096248725,0.0003571192,0.0019558526,0.00022896031,0.00007927408,0.00028595267,0.000107984575,0.2870627,0.15477745,0.015844734,0.0041616247,0.53417575],"study_design_scores_gemma":[0.000052056013,0.0003496744,0.00068491953,0.000008916128,0.000022705657,0.0001267667,0.000016640768,0.9578605,0.03417444,0.002153991,0.0045286524,0.00002076964],"about_ca_topic_score_codex":0.0013419937,"about_ca_topic_score_gemma":0.001394012,"teacher_disagreement_score":0.0014261879,"about_ca_system_score_codex":0.00040380692,"about_ca_system_score_gemma":0.0005836441,"threshold_uncertainty_score":0.004771054},"labels":[],"label_agreement":null},{"id":"W1969710891","doi":"10.1109/glocom.2006.426","title":"QRP02-3: SAM: A New Bandwidth Constraint Model for Diff-Serv-Aware MPLS Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bandwidth (computing); Computer science; Multiprotocol Label Switching; Constraint (computer-aided design); Computer network; Dynamic bandwidth allocation; Bandwidth management; Distributed computing; Quality of service; Engineering","score_opus":0.012389702287074153,"score_gpt":0.21609680070158935,"score_spread":0.2037070984145152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969710891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018495742,0.0003260833,0.97268146,0.00043202785,0.00011282804,0.000098205426,0.00037388608,0.000587922,0.006892017],"genre_scores_gemma":[0.71243554,0.0009556424,0.2731556,0.00038806468,0.00026042078,0.00042315337,0.0011441191,0.00026298806,0.01097446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962175,0.000110977315,0.00002024952,0.000042876123,0.00015909765,0.00004505089],"domain_scores_gemma":[0.99959534,0.00010627724,0.00005553036,0.000061603474,0.00014909229,0.000032212338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006558338,0.0005365379,0.0003933931,0.00038366523,0.0003203044,0.0008365314,0.0019641651,0.0008262211,0.0016017313],"category_scores_gemma":[0.0011902433,0.00023320277,0.00045011583,0.0005424729,0.000363137,0.0014599791,0.0005244054,0.00093988294,0.00043662067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012059282,0.00007498762,0.00065554766,0.0001375453,0.0000436852,0.0001927463,0.00008351452,0.81001824,0.009299205,0.11845692,0.006737472,0.054179538],"study_design_scores_gemma":[0.0000073323445,0.000017651791,0.0000490684,0.0000034167547,0.0000045748534,0.000024687712,0.000003426217,0.9899244,0.00088221557,0.005310895,0.0037677917,0.000004589755],"about_ca_topic_score_codex":0.0033559117,"about_ca_topic_score_gemma":0.0027992667,"teacher_disagreement_score":0.0033559117,"about_ca_system_score_codex":0.0007431474,"about_ca_system_score_gemma":0.0008910677,"threshold_uncertainty_score":0.0066727996},"labels":[],"label_agreement":null},{"id":"W1974581592","doi":"10.1109/glocom.2006.251","title":"NGL02-3: Price-Sensitive Application Adaptation in Deadline-Based Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","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 Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Transfer (computing); Adaptation (eye); Scheme (mathematics); Real-time computing; Computer network; Traffic intensity; Control (management); Operating system","score_opus":0.005018598314116307,"score_gpt":0.19122718687787707,"score_spread":0.18620858856376077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974581592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31602123,0.00069176353,0.66219145,0.00082275853,0.00019838089,0.00028487135,0.00012339912,0.0010591657,0.018606989],"genre_scores_gemma":[0.9685413,0.00015465145,0.028334886,0.00014714882,0.00004191682,0.000056218145,0.000033556902,0.000047455873,0.0026428201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.00047419104,0.0000370642,0.00010151964,0.00026607903,0.00018591278],"domain_scores_gemma":[0.9978765,0.0012405005,0.0002128281,0.0002343544,0.00030558291,0.00013018509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017139603,0.00045466534,0.00061697245,0.00033360778,0.00055772165,0.0010658421,0.0015790301,0.000865913,0.0015566072],"category_scores_gemma":[0.005659664,0.0002138321,0.00028979647,0.00060047884,0.00067469856,0.0011728148,0.00087545975,0.0008334335,0.0002208107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030709608,0.00029744374,0.0015991341,0.000109154,0.000043069813,0.00036618716,0.00014650825,0.89874864,0.013918032,0.021550983,0.003008083,0.059905723],"study_design_scores_gemma":[0.000015194835,0.000048846563,0.00023792264,0.000002279783,0.000004529633,0.00006909815,0.000013504828,0.9936631,0.0018616181,0.0031023566,0.00097433175,0.00000732094],"about_ca_topic_score_codex":0.0045527583,"about_ca_topic_score_gemma":0.0028297715,"teacher_disagreement_score":0.0045527583,"about_ca_system_score_codex":0.00144457,"about_ca_system_score_gemma":0.0008576236,"threshold_uncertainty_score":0.01048106},"labels":[],"label_agreement":null},{"id":"W1976401000","doi":"10.1109/glocom.2006.62","title":"CTH05-5: Evaluation of Bit Error Rate for Packet Combining with Constellation Rearrangement","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Bit error rate; Network packet; Computer science; Algorithm; Constellation; Logarithm; Telecommunications link; Erlang (programming language); Piecewise; Mathematics; Theoretical computer science; Computer network; Decoding methods","score_opus":0.03176887121044083,"score_gpt":0.2841361770211035,"score_spread":0.2523673058106627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976401000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32174832,0.0012879337,0.651803,0.00029220167,0.00011854968,0.00035435118,0.00089010934,0.0037592752,0.019746216],"genre_scores_gemma":[0.9073421,0.00030270498,0.08948653,0.00008544979,0.000019018085,0.00016444355,0.00056852936,0.00016498014,0.001866308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967276,0.00096241664,0.000108415596,0.00018384936,0.0017773291,0.00024045481],"domain_scores_gemma":[0.99227506,0.004882751,0.0007160255,0.0007493352,0.0012744366,0.000102397804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003431399,0.0011379811,0.0006834727,0.0015254732,0.00042129107,0.0008094369,0.0013491997,0.0011629409,0.0017879758],"category_scores_gemma":[0.0131472675,0.00016664626,0.00040479295,0.0013622644,0.0010766083,0.0010985935,0.00075188436,0.00062967755,0.0004951431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049490447,0.000107807224,0.0046654115,0.00014463214,0.000087937675,0.00018849075,0.00006194698,0.93186635,0.01330315,0.0071420223,0.0010956364,0.040841766],"study_design_scores_gemma":[0.000012605755,0.00030433544,0.0012423098,0.000014571285,0.000015253837,0.00016233546,0.000016346074,0.97092605,0.026067382,0.0006578167,0.00055562396,0.000025345438],"about_ca_topic_score_codex":0.0053365068,"about_ca_topic_score_gemma":0.003666451,"teacher_disagreement_score":0.0053365068,"about_ca_system_score_codex":0.0017434101,"about_ca_system_score_gemma":0.000931458,"threshold_uncertainty_score":0.01814717},"labels":[],"label_agreement":null},{"id":"W1979865924","doi":"10.1109/glocom.2006.268","title":"NIS02-2: A Secure Routing Protocol for Heterogeneous Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Université du Québec","funders":"","keywords":"Computer network; Wireless Routing Protocol; Computer science; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Dynamic Source Routing; Distributed computing; Interior gateway protocol; Hierarchical routing; Static routing; Optimized Link State Routing Protocol; Routing (electronic design automation)","score_opus":0.012125390599099933,"score_gpt":0.25441847625364933,"score_spread":0.2422930856545494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139704645,0.0013093714,0.95934963,0.00072458363,0.00060054025,0.0009412863,0.00058581174,0.005780971,0.01673736],"genre_scores_gemma":[0.3707378,0.0016891735,0.5923578,0.001351844,0.00017618042,0.0022232998,0.0044223103,0.00072438363,0.026317257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.00026517097,0.00010203393,0.0000630679,0.00047367916,0.00008499219],"domain_scores_gemma":[0.99933356,0.00015328702,0.000084937696,0.00017891967,0.00019633361,0.000052987914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013941474,0.00059564743,0.0006801627,0.00083675265,0.0009520267,0.0008366674,0.00190003,0.0009930643,0.0023139392],"category_scores_gemma":[0.0022723577,0.00029352112,0.00059307757,0.0009243023,0.0006659114,0.0014820725,0.0019687917,0.0012959711,0.0011135372],"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.0011243866,0.00038389416,0.0015220132,0.0011081017,0.00028966108,0.0013574077,0.00058846624,0.19465835,0.09049765,0.23139301,0.087006964,0.39007005],"study_design_scores_gemma":[0.00032369574,0.0004558227,0.0007023821,0.00009281807,0.00015424196,0.0010700808,0.00010507851,0.67778546,0.042973816,0.053565223,0.2226028,0.00016863666],"about_ca_topic_score_codex":0.0013414072,"about_ca_topic_score_gemma":0.0033419046,"teacher_disagreement_score":0.0023139392,"about_ca_system_score_codex":0.00092576497,"about_ca_system_score_gemma":0.0018825792,"threshold_uncertainty_score":0.007740915},"labels":[],"label_agreement":null},{"id":"W1985384853","doi":"10.1109/glocom.2006.267","title":"NIS02-1: Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wormhole; Computer science; Computer network; Wireless ad hoc network; Countermeasure; Network packet; Distance-vector routing protocol; Routing protocol; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless; Wireless network; Computer security; Telecommunications; Engineering","score_opus":0.007356705943957545,"score_gpt":0.22036796923443552,"score_spread":0.21301126329047798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985384853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17653538,0.0061235954,0.7838767,0.0013223162,0.0003880598,0.0005106633,0.00021905775,0.0021349746,0.028889263],"genre_scores_gemma":[0.9155928,0.0026512544,0.07465219,0.0001430057,0.000121541554,0.00029786504,0.00039181396,0.00009577875,0.0060537644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859613,0.00032532756,0.000083715095,0.0000604156,0.00083891285,0.0000955792],"domain_scores_gemma":[0.99793756,0.0009469245,0.00029676384,0.00023120105,0.0005378011,0.00004967085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097387074,0.0007952592,0.0006591914,0.001650014,0.00040144718,0.0009358712,0.0008375767,0.0011086345,0.0010264794],"category_scores_gemma":[0.004415078,0.00023126267,0.0005592971,0.0011290024,0.00079712336,0.0016911888,0.0007645768,0.00080285704,0.00028895857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005604058,0.00041863899,0.011271343,0.00081137294,0.0003122031,0.0008673703,0.00021804604,0.6073112,0.03356083,0.11131237,0.00924001,0.2241162],"study_design_scores_gemma":[0.000015277283,0.0002403522,0.001341998,0.000027317057,0.00003982356,0.0006116132,0.000034789264,0.9747489,0.009261649,0.0093752965,0.0042750062,0.00002802857],"about_ca_topic_score_codex":0.00070894306,"about_ca_topic_score_gemma":0.0007071617,"teacher_disagreement_score":0.001650014,"about_ca_system_score_codex":0.000847741,"about_ca_system_score_gemma":0.0006579571,"threshold_uncertainty_score":0.0061508417},"labels":[],"label_agreement":null},{"id":"W1987640939","doi":"10.1109/glocom.2006.657","title":"WLC08-1: Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Subcarrier; Bit error rate; Electronic engineering; Fading; QAM; Interleaving; Spectral efficiency; Quadrature amplitude modulation; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.01629084616820636,"score_gpt":0.25109651432534474,"score_spread":0.23480566815713838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987640939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008872374,0.0010094775,0.98593235,0.00015805927,0.000057644647,0.000034351277,0.00011825681,0.00021929147,0.0035982255],"genre_scores_gemma":[0.7460978,0.006155198,0.23309246,0.00040174188,0.00043937622,0.0003559499,0.0007750683,0.00056625874,0.012116171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807835,0.0005024653,0.00007104131,0.00013887371,0.0010471193,0.00016207765],"domain_scores_gemma":[0.99317247,0.004203692,0.00058607897,0.000581988,0.0014049734,0.000050771672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030750965,0.0014293295,0.00065196626,0.0018649411,0.00045950015,0.0010781104,0.0009381633,0.0008306511,0.002574207],"category_scores_gemma":[0.013400065,0.00027930865,0.0005567929,0.001189225,0.0009883976,0.0017598624,0.0006813818,0.0013296437,0.0010718416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010566305,0.00007033309,0.0013708089,0.0003056176,0.00007816028,0.00022535388,0.00016707173,0.83602077,0.011322809,0.09607936,0.0042113876,0.05004278],"study_design_scores_gemma":[0.0000020239208,0.000019658775,0.00026748897,0.000017698627,0.000006327525,0.00006384342,0.000010429262,0.99198407,0.0019191636,0.004873628,0.0008253185,0.000010408594],"about_ca_topic_score_codex":0.0039199926,"about_ca_topic_score_gemma":0.0022065835,"teacher_disagreement_score":0.0039199926,"about_ca_system_score_codex":0.0012510117,"about_ca_system_score_gemma":0.0011802915,"threshold_uncertainty_score":0.01626283},"labels":[],"label_agreement":null},{"id":"W1988470794","doi":"10.1109/glocom.2006.92","title":"CTH10-6: Diagonal Block Space-Time Code Design for Continuous-Phase Modulation","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Continuous phase modulation; Diagonal; Algorithm; Computer science; Upper and lower bounds; Modulation (music); Fading; Block code; Coding (social sciences); Code (set theory); Space–time code; Time domain; Power (physics); Control theory (sociology); Electronic engineering; Mathematics; Telecommunications; Decoding methods; Physics; Engineering","score_opus":0.01464805664415205,"score_gpt":0.2618840590123122,"score_spread":0.24723600236816015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988470794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014552337,0.00032444668,0.9786456,0.00014691797,0.00006474005,0.00005982066,0.00011579484,0.00026467716,0.005825519],"genre_scores_gemma":[0.42317185,0.0005314803,0.56971556,0.0002002929,0.000082375904,0.00024789214,0.00046479466,0.000103570645,0.0054821223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.00018319262,0.00002578351,0.00005590268,0.00025908122,0.00005995749],"domain_scores_gemma":[0.9990996,0.0002856663,0.00010344047,0.00011336405,0.0003516337,0.000046232683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452912,0.00062753755,0.0002923771,0.00050084095,0.00029987353,0.0005860857,0.0005508494,0.0007019028,0.0029080522],"category_scores_gemma":[0.0021844609,0.00017299695,0.00020796913,0.0007208948,0.00043733945,0.00043454266,0.00049238413,0.00060537487,0.00095950876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036688658,0.00011121448,0.0009304787,0.00029723227,0.000055595818,0.00017721963,0.00012209886,0.48017505,0.065552585,0.16501106,0.0077021485,0.27949846],"study_design_scores_gemma":[0.000041660212,0.00018963478,0.00014242245,0.000029321243,0.0000096418535,0.00016318134,0.00001090194,0.95798093,0.02073328,0.012938446,0.0077407565,0.0000197841],"about_ca_topic_score_codex":0.0016197907,"about_ca_topic_score_gemma":0.0022001613,"teacher_disagreement_score":0.0029080522,"about_ca_system_score_codex":0.00057354174,"about_ca_system_score_gemma":0.001101704,"threshold_uncertainty_score":0.009728372},"labels":[],"label_agreement":null},{"id":"W1998348540","doi":"10.1109/glocom.2006.833","title":"WLC37-5: On Partial Transmit Sequences to Reduce PAR in OFDM Systems","year":2006,"lang":"fr","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Redundancy (engineering); Computer science; Reduction (mathematics); Computational complexity theory; Multiplexing; Scheme (mathematics); Embedding; Frequency-division multiplexing; Algorithm; Mathematics; Channel (broadcasting); Telecommunications","score_opus":0.015244369436984219,"score_gpt":0.24536318506453814,"score_spread":0.23011881562755393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998348540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039505884,0.00047499713,0.9502519,0.00022360036,0.00006173895,0.000078182195,0.00006812945,0.00047746013,0.008858152],"genre_scores_gemma":[0.5423946,0.00096824544,0.44727215,0.00021392849,0.00013576198,0.00018485739,0.00029401173,0.00019845282,0.008338027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996743,0.00010912068,0.000014177204,0.000027562679,0.00013722756,0.000037542948],"domain_scores_gemma":[0.9994862,0.00025806416,0.000046844387,0.00008618927,0.00010392306,0.000018740659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052305224,0.00080943375,0.00052501756,0.0004605003,0.00030821082,0.0004912941,0.00057529256,0.00045646707,0.0034221152],"category_scores_gemma":[0.0019139579,0.00019191031,0.00032948394,0.00065028673,0.0005092659,0.0007464269,0.0006261876,0.00046780249,0.000932864],"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.0002755595,0.0001279158,0.00042623395,0.0002575323,0.000050846513,0.00022612128,0.00012914043,0.4285053,0.051613234,0.054695036,0.0045331456,0.4591599],"study_design_scores_gemma":[0.000029704159,0.00034149503,0.00028639162,0.00002642658,0.000020648236,0.00024978473,0.00003300498,0.95094484,0.027880209,0.012497751,0.0076742615,0.00001534713],"about_ca_topic_score_codex":0.0008745935,"about_ca_topic_score_gemma":0.0014975822,"teacher_disagreement_score":0.0034221152,"about_ca_system_score_codex":0.00025986737,"about_ca_system_score_gemma":0.0007140137,"threshold_uncertainty_score":0.011448085},"labels":[],"label_agreement":null},{"id":"W1998603051","doi":"10.1109/glocom.2006.823","title":"WLC36-1: On the Optimality of Beamforming in MIMO Fading Ad-Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Channel state information; Transmitter; MIMO; Rayleigh fading; Beamforming; Fading; Wireless ad hoc network; Computer science; Interference (communication); Channel (broadcasting); Channel capacity; Multi-user MIMO; Computer network; Telecommunications; Wireless","score_opus":0.007976712373596593,"score_gpt":0.20610684025193954,"score_spread":0.19813012787834294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998603051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10898869,0.005628299,0.8282625,0.0030137636,0.00028892743,0.00014456287,0.000573478,0.0002923647,0.05280736],"genre_scores_gemma":[0.92960185,0.0046362835,0.058048077,0.00044189102,0.00055353896,0.00020287276,0.00030966307,0.00021209991,0.0059937458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982375,0.0010478076,0.00004547499,0.00011896468,0.00033823887,0.0002120435],"domain_scores_gemma":[0.9896583,0.008435781,0.00037829412,0.0002700021,0.0010113427,0.0002463201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032481255,0.0016604245,0.0015840838,0.00097531645,0.000622644,0.0017177999,0.00090457645,0.0013201174,0.0034054127],"category_scores_gemma":[0.015294092,0.000516785,0.0004081287,0.0014531803,0.002606626,0.002240722,0.0016455388,0.0013864592,0.0007174364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013582954,0.000060139642,0.00079359463,0.00022358718,0.00006119713,0.0001336797,0.00009077031,0.86404425,0.0022084452,0.11412455,0.00527012,0.012853817],"study_design_scores_gemma":[0.000014715581,0.00007579039,0.00024819898,0.000038521648,0.000010919558,0.00004017098,0.00003321499,0.9476232,0.0005010846,0.050712608,0.000689252,0.000012361167],"about_ca_topic_score_codex":0.0028347757,"about_ca_topic_score_gemma":0.001570849,"teacher_disagreement_score":0.0034054127,"about_ca_system_score_codex":0.0014565464,"about_ca_system_score_gemma":0.0014001882,"threshold_uncertainty_score":0.01717794},"labels":[],"label_agreement":null},{"id":"W1999623030","doi":"10.1109/glocom.2006.606","title":"SPCp1-04: Bit Mapping and Error Insertion for FEC Based PAPR Reduction in OFDM Signals","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Bit error rate; Reduction (mathematics); Forward error correction; Computer science; Algorithm; Redundancy (engineering); Additive white Gaussian noise; Error detection and correction; Decoding methods; Electronic engineering; Mathematics; Telecommunications; White noise; Channel (broadcasting); Engineering","score_opus":0.017114801214399858,"score_gpt":0.22652296278153006,"score_spread":0.2094081615671302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999623030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09800196,0.00076815236,0.89434123,0.00026347913,0.00012398236,0.00011117778,0.000053176067,0.0014347171,0.004902076],"genre_scores_gemma":[0.49513894,0.00055188156,0.499671,0.00013389497,0.00010748374,0.000074513395,0.00013864653,0.00008478113,0.0040987437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967384,0.00006905708,0.000017857881,0.000040826297,0.00017813055,0.00002020447],"domain_scores_gemma":[0.99952304,0.00013384868,0.00007872423,0.00012988111,0.000118862794,0.000015517473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366775,0.0004367316,0.0002824156,0.00049971434,0.0002500382,0.00036997985,0.0006288493,0.0004548797,0.0008704707],"category_scores_gemma":[0.0010641199,0.00015550476,0.0001612611,0.0003437459,0.00036808892,0.00042659993,0.00027990286,0.00042692904,0.0005372039],"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.00037120297,0.0001654069,0.0014673866,0.00023040264,0.000039277875,0.00041581798,0.00013257535,0.018121136,0.3767147,0.008998091,0.0021607778,0.59118325],"study_design_scores_gemma":[0.00007440083,0.0010309059,0.0027749748,0.00004521974,0.000051916184,0.0033469617,0.000027251794,0.28341064,0.6818159,0.0029788213,0.02438943,0.0000535245],"about_ca_topic_score_codex":0.00021078858,"about_ca_topic_score_gemma":0.00039074186,"teacher_disagreement_score":0.0008704707,"about_ca_system_score_codex":0.00015489462,"about_ca_system_score_gemma":0.0002987381,"threshold_uncertainty_score":0.002911985},"labels":[],"label_agreement":null},{"id":"W2001824121","doi":"10.1109/glocom.2006.649","title":"WLC06-5: A Novel Nonlinear Joint Transmitter-Receiver Processing Algorithm for the Downlink of Multi-User MIMO Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transmitter; MIMO; Computer science; Telecommunications link; Algorithm; Base station; Multi-user MIMO; Joint (building); Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.01512560698265545,"score_gpt":0.22826863910454223,"score_spread":0.2131430321218868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001824121","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.0023305172,0.00006127065,0.9959799,0.00005104062,0.00002192765,0.000027331645,0.00003531662,0.0002256681,0.001267044],"genre_scores_gemma":[0.05035976,0.00010856987,0.94497687,0.00008942048,0.000030389338,0.00013460974,0.00026161555,0.000079511294,0.0039593102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954456,0.00010462855,0.00002284235,0.0000598857,0.00021868292,0.00004932461],"domain_scores_gemma":[0.99966383,0.00008617993,0.000043680066,0.00005021488,0.00013559582,0.000020428279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007668615,0.000883883,0.0006851984,0.00050116115,0.00046505834,0.0009443847,0.0010528293,0.0010478786,0.0032224],"category_scores_gemma":[0.0010907874,0.00032866633,0.0004066956,0.00073321216,0.00047582664,0.0010032725,0.0008447502,0.001103917,0.0018926059],"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.00022530717,0.00012366708,0.0007337045,0.00016164768,0.000056729874,0.00008551965,0.000107202366,0.42234242,0.022737605,0.030513568,0.008481295,0.51443136],"study_design_scores_gemma":[0.000030076524,0.00006630837,0.00012886013,0.0000080630425,0.0000046677505,0.000054337816,0.000008781261,0.9859044,0.0058634495,0.002617265,0.0052978043,0.000015858133],"about_ca_topic_score_codex":0.0025146548,"about_ca_topic_score_gemma":0.0041941586,"teacher_disagreement_score":0.0032224,"about_ca_system_score_codex":0.0006320122,"about_ca_system_score_gemma":0.0017349768,"threshold_uncertainty_score":0.010780036},"labels":[],"label_agreement":null},{"id":"W2004340808","doi":"10.1109/glocom.2006.703","title":"WLC15-6: A QoS-Based MAC Protocol for Ad Hoc WLANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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 British Columbia","funders":"","keywords":"Distributed coordination function; Computer network; Computer science; Wireless ad hoc network; Inter-Access Point Protocol; Quality of service; IEEE 802.11; Service set; IEEE 802.11s; Ad hoc wireless distribution service; Vehicular ad hoc network; IEEE 802.11e-2005; Protocol (science); IEEE 802.1X; Optimized Link State Routing Protocol; Throughput; Wi-Fi; Wireless; Wireless network; Telecommunications; Wi-Fi array; Wireless mesh network","score_opus":0.021446948319641022,"score_gpt":0.3059649959355978,"score_spread":0.2845180476159568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004340808","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.011439734,0.004557939,0.9623688,0.0009609086,0.0019768295,0.0011954813,0.0005219835,0.0073813014,0.009597052],"genre_scores_gemma":[0.17808127,0.0054355776,0.76494163,0.00226451,0.0017485932,0.0038381303,0.004015234,0.0011669706,0.038508076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809533,0.0003500656,0.0002795847,0.00012568802,0.000936909,0.0002124347],"domain_scores_gemma":[0.99867827,0.0001552896,0.00022196338,0.00020031199,0.00057739473,0.00016684835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002532095,0.0011919128,0.0010797638,0.0019813096,0.0011322232,0.0024219744,0.003409986,0.0016082344,0.0036683239],"category_scores_gemma":[0.0028167218,0.00040346343,0.0005401094,0.0010745294,0.0011295183,0.0018734738,0.0020305242,0.0026039283,0.0032332863],"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.0008962298,0.0004954514,0.001407964,0.00211808,0.00017044206,0.0008863758,0.0007421692,0.016221842,0.12797476,0.14279193,0.0888207,0.6174741],"study_design_scores_gemma":[0.0003006156,0.0012970818,0.0012868062,0.00041022463,0.00017156957,0.0016910136,0.00013201422,0.16815533,0.07016739,0.020738462,0.7353616,0.00028791607],"about_ca_topic_score_codex":0.0009314651,"about_ca_topic_score_gemma":0.0012860077,"teacher_disagreement_score":0.0036683239,"about_ca_system_score_codex":0.00094196195,"about_ca_system_score_gemma":0.0012001792,"threshold_uncertainty_score":0.013391137},"labels":[],"label_agreement":null},{"id":"W2013173551","doi":"10.1109/glocom.2006.747","title":"WLC23-3: Multiuser Performance of Balanced UWB Transmitted-Reference System in Multipath","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipath propagation; Computer science; Multipath interference; Ultra-wideband; Interference (communication); Electronic engineering; Communications system; Multiuser detection; Wideband; Telecommunications; Computer network; Real-time computing; Code division multiple access; Engineering; Channel (broadcasting)","score_opus":0.005941723893070796,"score_gpt":0.18460363589806325,"score_spread":0.17866191200499246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013173551","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.92476094,0.0003854504,0.071413256,0.00008269911,0.000031937394,0.000022630336,0.00010540864,0.00029224856,0.0029053953],"genre_scores_gemma":[0.9960226,0.000052080766,0.0035260895,0.000016118891,0.0000056709846,0.000007855675,0.000046326055,0.0000138339865,0.00030945052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991629,0.00021691833,0.000027085653,0.000107046995,0.00027411242,0.00021198076],"domain_scores_gemma":[0.99828416,0.0007326158,0.0002077115,0.00021445485,0.00047753283,0.00008353704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008667045,0.0006365678,0.0006307777,0.0004122578,0.00039027783,0.0007787384,0.0006171698,0.0008155746,0.0013765286],"category_scores_gemma":[0.0022390978,0.00013777491,0.00036373897,0.0005211741,0.00056205457,0.00067065726,0.00048941164,0.0003871534,0.0002752891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039567337,0.00019304923,0.013174548,0.00034860187,0.00055620243,0.0019631563,0.00047157492,0.56748724,0.35265458,0.015085748,0.0009941281,0.043114465],"study_design_scores_gemma":[0.000056010645,0.0009043695,0.0041300175,0.000018884593,0.000106229636,0.0007791983,0.00008399946,0.9232509,0.068796165,0.0012408529,0.00056911,0.00006415794],"about_ca_topic_score_codex":0.002191005,"about_ca_topic_score_gemma":0.0015589027,"teacher_disagreement_score":0.002191005,"about_ca_system_score_codex":0.00063408527,"about_ca_system_score_gemma":0.00054353283,"threshold_uncertainty_score":0.0046049953},"labels":[],"label_agreement":null},{"id":"W2015196856","doi":"10.1109/glocom.2006.541","title":"SPC02-4: Channel Estimation for OFDM-Based SPRAS-MIMO System","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MIMO; Orthogonal frequency-division multiplexing; MIMO-OFDM; Channel (broadcasting); Computer science; Channel state information; Frequency domain; Weighting; Precoding; Electronic engineering; Algorithm; Control theory (sociology); Telecommunications; Engineering; Wireless; Artificial intelligence","score_opus":0.007958958664258832,"score_gpt":0.22605529092804902,"score_spread":0.2180963322637902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015196856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025718609,0.00032797063,0.9688843,0.00018149833,0.00006400031,0.000058010846,0.00006901986,0.0006811762,0.004015322],"genre_scores_gemma":[0.7802429,0.00039269062,0.21387137,0.00010377142,0.00018912865,0.00009721842,0.00022227853,0.000041653166,0.004839004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00017249263,0.000018128962,0.00005870748,0.00020057852,0.000040669594],"domain_scores_gemma":[0.99954396,0.00013508591,0.000038997976,0.0000682746,0.00019212638,0.000021653748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056560204,0.00041180901,0.00039750515,0.0003198366,0.0004307866,0.00046451628,0.0004035448,0.00044721802,0.0015857432],"category_scores_gemma":[0.00094308483,0.00016431106,0.00017722626,0.00030742225,0.00045436292,0.00043161854,0.00032270743,0.00038739396,0.0006479007],"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.00083270716,0.00015765736,0.0031272117,0.00036136588,0.00011677109,0.00070929783,0.00022138686,0.4056076,0.12027809,0.026376594,0.012286011,0.4299253],"study_design_scores_gemma":[0.000027836062,0.00013734723,0.0005001265,0.000006957343,0.0000145571,0.0002195441,0.000018281833,0.97562337,0.018608756,0.0013330706,0.0034933942,0.000016626856],"about_ca_topic_score_codex":0.0017866063,"about_ca_topic_score_gemma":0.0027223183,"teacher_disagreement_score":0.0017866063,"about_ca_system_score_codex":0.00028592354,"about_ca_system_score_gemma":0.00062431704,"threshold_uncertainty_score":0.005304873},"labels":[],"label_agreement":null},{"id":"W2015949613","doi":"10.1109/glocom.2006.559","title":"SPC05-4: Successively Structured Gaussian CEO Problem","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gaussian; Rate distortion; Relay; Mathematical optimization; Rate–distortion theory; Fusion center; Coding (social sciences); Computer science; Dirty paper coding; Distortion (music); Mathematics; Topology (electrical circuits); Beamforming; Bandwidth (computing); Telecommunications; Wireless; Statistics; MIMO; Combinatorics; Precoding; Cognitive radio","score_opus":0.004476794363137375,"score_gpt":0.19999432365176195,"score_spread":0.19551752928862456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015949613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063112415,0.0004748314,0.9250645,0.001235325,0.000076912016,0.000117489064,0.00032112052,0.00015387691,0.009443429],"genre_scores_gemma":[0.8675106,0.000631743,0.12325208,0.00052022585,0.00017061105,0.0002692821,0.0006140715,0.0001080388,0.0069233095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984346,0.0007360516,0.000047641293,0.00025164636,0.00025445438,0.00027558772],"domain_scores_gemma":[0.9937875,0.004350152,0.00055886304,0.00036137132,0.0006007319,0.00034138953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027639726,0.00092927116,0.0013213024,0.0004456787,0.00056649087,0.0014463507,0.0014130553,0.0019339639,0.003462627],"category_scores_gemma":[0.008942053,0.00036755367,0.00068167696,0.00080222887,0.0016648348,0.0022295052,0.0021322994,0.0017966093,0.00046361715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003204155,0.000113221584,0.0008750851,0.000209757,0.00006723939,0.0003510003,0.00015371181,0.73979145,0.0024922544,0.2277155,0.0060073785,0.021902889],"study_design_scores_gemma":[0.00006255917,0.00008204691,0.00013933866,0.0000133247495,0.000009982022,0.00007272267,0.00004153401,0.9303849,0.0009719456,0.06727129,0.00093672547,0.000013620666],"about_ca_topic_score_codex":0.0025695087,"about_ca_topic_score_gemma":0.0014812709,"teacher_disagreement_score":0.003462627,"about_ca_system_score_codex":0.0012550462,"about_ca_system_score_gemma":0.0018177096,"threshold_uncertainty_score":0.014617443},"labels":[],"label_agreement":null},{"id":"W2016739648","doi":"10.1109/glocom.2006.792","title":"WLC30-6: Admission Control in Power Constrained OFDM/TDMA Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless mesh network; Router; Computer network; Network packet; Sleep mode; Mesh networking; Switched mesh; Markov decision process; Time division multiple access; Shared mesh; Markov process; Power (physics); Wireless; Wireless network; Power consumption; Telecommunications","score_opus":0.002707240748214062,"score_gpt":0.18765943726305678,"score_spread":0.1849521965148427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016739648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21995464,0.0006840992,0.77102333,0.0007196489,0.00009698357,0.00015734258,0.000060546874,0.00020766092,0.007095697],"genre_scores_gemma":[0.9859272,0.00014894182,0.012934479,0.00003626822,0.000030687464,0.000044747536,0.000012851367,0.000009572527,0.00085530384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.00032904942,0.000028225255,0.00007417877,0.00022034817,0.00020915474],"domain_scores_gemma":[0.9982444,0.001177393,0.00020726159,0.0000598828,0.00019415744,0.00011688412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017825782,0.00059157837,0.00070751726,0.00043447144,0.00049072335,0.0009798598,0.0007919631,0.00067788153,0.0011836287],"category_scores_gemma":[0.0041528014,0.00019567955,0.0003233258,0.0005346763,0.0009154799,0.00077205914,0.00077282795,0.0006681787,0.00008298778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120755256,0.00007602956,0.00062844297,0.000043089927,0.000023663946,0.00007185323,0.000040729272,0.9646466,0.0030522512,0.014873379,0.000443408,0.015979784],"study_design_scores_gemma":[0.0000051220263,0.000016413429,0.000043885928,0.0000012259507,0.000002426246,0.000004492967,0.0000038058326,0.9982293,0.0002873092,0.0013532728,0.00005079998,0.0000018243145],"about_ca_topic_score_codex":0.0067235883,"about_ca_topic_score_gemma":0.0030577297,"teacher_disagreement_score":0.0067235883,"about_ca_system_score_codex":0.001351377,"about_ca_system_score_gemma":0.001350652,"threshold_uncertainty_score":0.013368905},"labels":[],"label_agreement":null},{"id":"W2017810375","doi":"10.1109/glocom.2006.557","title":"SPC05-2: Turbo Coded MC-CDM Communications with Spatial Multiplexing","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Turbo code; MIMO; Bit error rate; Fading; Single antenna interference cancellation; Electronic engineering; Decoding methods; Multiplexing; Spatial multiplexing; Orthogonal frequency-division multiplexing; Turbo; Interference (communication); Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.00884352238903985,"score_gpt":0.2200734737169966,"score_spread":0.21122995132795674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017810375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45104235,0.0021480578,0.51466477,0.00075862964,0.00032257382,0.00031103886,0.00025328164,0.0008457267,0.029653624],"genre_scores_gemma":[0.9428221,0.0003737235,0.05330344,0.00010696356,0.000065942215,0.000060244227,0.00008407957,0.000016877608,0.0031665687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991652,0.00030206458,0.00002690668,0.000045826757,0.00032420896,0.00013580416],"domain_scores_gemma":[0.99834657,0.00058217015,0.000181461,0.00020282027,0.00060256413,0.00008436137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094675715,0.0007496468,0.00051929965,0.0007176231,0.00063690403,0.00082658953,0.00084624026,0.001056155,0.0015395633],"category_scores_gemma":[0.0019633379,0.00013822337,0.00030444897,0.0009983353,0.0007621508,0.00068322296,0.000509807,0.00035968915,0.00043063203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015090883,0.00029230793,0.0061932663,0.00057089655,0.00024432305,0.0027355666,0.00023206149,0.6467876,0.09519817,0.06121174,0.008531604,0.17649342],"study_design_scores_gemma":[0.000032146596,0.0004371522,0.00072837545,0.000018923689,0.000040065923,0.0011815937,0.00003665491,0.95360756,0.037530128,0.0028313214,0.003522382,0.000033653312],"about_ca_topic_score_codex":0.00251372,"about_ca_topic_score_gemma":0.003979215,"teacher_disagreement_score":0.00251372,"about_ca_system_score_codex":0.0005607164,"about_ca_system_score_gemma":0.0011518833,"threshold_uncertainty_score":0.005150318},"labels":[],"label_agreement":null},{"id":"W2022345288","doi":"10.1109/glocom.2006.892","title":"WLC47-5: Modeling Wireless TCP Connection Arrival Process","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","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 Calgary","funders":"","keywords":"Computer network; Computer science; Wireless network; Wireless; Quality of service; Telecommunications","score_opus":0.00761181839861558,"score_gpt":0.2139359930435849,"score_spread":0.20632417464496933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022345288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16246064,0.00020457526,0.8327295,0.00025586714,0.000057528094,0.00014193953,0.00034527294,0.0004099438,0.003394721],"genre_scores_gemma":[0.96116656,0.0003560254,0.034471925,0.000052405085,0.00005354791,0.00017428459,0.0002675152,0.000044959004,0.0034128684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00012621593,0.000027852931,0.00008857943,0.00016165078,0.00007529263],"domain_scores_gemma":[0.998871,0.0004427203,0.00020278309,0.00012195801,0.00031091817,0.00005052906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012318223,0.0005398191,0.00044810367,0.00061607786,0.00038174362,0.0008151943,0.001107674,0.0010009687,0.0013753236],"category_scores_gemma":[0.0035649184,0.00030672958,0.0005867089,0.0006893674,0.0005498881,0.0010357507,0.0004912005,0.0009648849,0.0004727866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032709744,0.000060835042,0.0035497933,0.000029875897,0.000015394598,0.00012408193,0.000063408464,0.96403354,0.003978237,0.018773133,0.00067897176,0.0086600855],"study_design_scores_gemma":[9.180798e-7,0.0000063633847,0.0002034054,8.428269e-7,0.0000015607417,0.000008262584,0.000002055471,0.9984586,0.00022545585,0.0009816003,0.00010895774,0.0000018923284],"about_ca_topic_score_codex":0.01051603,"about_ca_topic_score_gemma":0.0046257116,"teacher_disagreement_score":0.01051603,"about_ca_system_score_codex":0.0008172838,"about_ca_system_score_gemma":0.0009397862,"threshold_uncertainty_score":0.020909607},"labels":[],"label_agreement":null},{"id":"W2023369145","doi":"10.1109/glocom.2006.683","title":"WLC12-4: Reliable and Energy Efficient Transport Layer for Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Sink (geography); Energy consumption; Wireless sensor network; Reliability (semiconductor); Computer network; Transport layer; Real-time computing; Layer (electronics); Engineering","score_opus":0.0067392011128158515,"score_gpt":0.1960580406264807,"score_spread":0.18931883951366485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023369145","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.019021207,0.0024056213,0.9506406,0.0009524304,0.00067917764,0.0011368094,0.0010822164,0.013070173,0.011011617],"genre_scores_gemma":[0.34126943,0.0038077154,0.610932,0.0011490878,0.00036715792,0.0027204796,0.004937798,0.0015158429,0.033300437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874336,0.00024206389,0.00011435739,0.000084572,0.00065645255,0.00015916338],"domain_scores_gemma":[0.9984238,0.00022828547,0.00018160869,0.00037700133,0.0006994428,0.00008974923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019453418,0.0010637292,0.00070459297,0.0010879044,0.0007441977,0.0019481935,0.0027547758,0.0012667774,0.003842553],"category_scores_gemma":[0.003695289,0.0005163919,0.000498452,0.0010146202,0.00072873384,0.0015579774,0.0011311156,0.0017324291,0.001985988],"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.0012238845,0.00039386057,0.0030153086,0.002685193,0.0005414401,0.0008006729,0.00045214986,0.2478395,0.09751784,0.08114567,0.11129156,0.4530929],"study_design_scores_gemma":[0.00030492028,0.00056967797,0.0006993573,0.00016979057,0.0001415834,0.0003413888,0.000048977625,0.767578,0.07235595,0.009932221,0.14772333,0.00013482284],"about_ca_topic_score_codex":0.0058476455,"about_ca_topic_score_gemma":0.007909364,"teacher_disagreement_score":0.0058476455,"about_ca_system_score_codex":0.001485786,"about_ca_system_score_gemma":0.0024767937,"threshold_uncertainty_score":0.012854636},"labels":[],"label_agreement":null},{"id":"W2028496278","doi":"10.1109/glocom.2006.566","title":"SPC06-5: Turbo Equalization with Integrated SNR Estimation","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Turbo; Equalization (audio); Turbo equalizer; Subspace topology; Signal-to-noise ratio (imaging); Algorithm; Turbo code; Decoding methods; A priori and a posteriori; Telecommunications; Low-density parity-check code; Artificial intelligence; Engineering","score_opus":0.003590231735359154,"score_gpt":0.19585164730102816,"score_spread":0.192261415565669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028496278","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.009239977,0.00031651903,0.9859822,0.000115876865,0.0001025391,0.000060392354,0.000047709447,0.00079275196,0.0033421188],"genre_scores_gemma":[0.2770365,0.00047408315,0.71351403,0.0003414406,0.00026181343,0.00012009222,0.00026080792,0.00011838111,0.007872875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879384,0.00035221517,0.00007867453,0.00012752174,0.00051108224,0.00013669739],"domain_scores_gemma":[0.9982509,0.00029000055,0.00012306747,0.000376277,0.00085199816,0.00010766851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672815,0.00093856617,0.0009985332,0.0007584384,0.0005821671,0.0010992404,0.0015491401,0.0019582086,0.0026142485],"category_scores_gemma":[0.0021544008,0.000428285,0.00078856194,0.0007141233,0.00086513814,0.0014163185,0.0012389561,0.0011952007,0.002599329],"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.0012047488,0.0003895298,0.0037229983,0.0005339073,0.00050563406,0.0009666503,0.0002752742,0.244467,0.16202156,0.05779258,0.01022436,0.51789576],"study_design_scores_gemma":[0.00007559866,0.0007624706,0.0006145023,0.000035166504,0.00011641587,0.0011363205,0.000017308594,0.9053588,0.07621887,0.0043014763,0.011265603,0.00009749924],"about_ca_topic_score_codex":0.0009318703,"about_ca_topic_score_gemma":0.0017982713,"teacher_disagreement_score":0.0026142485,"about_ca_system_score_codex":0.000344542,"about_ca_system_score_gemma":0.0012852027,"threshold_uncertainty_score":0.008745551},"labels":[],"label_agreement":null},{"id":"W2039357626","doi":"10.1109/glocom.2006.492","title":"WSN05-5: On Node Population in a Multi-Level 802.15.4 Sensor Network","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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 Manitoba","funders":"","keywords":"Node (physics); Cluster (spacecraft); Reliability (semiconductor); Wireless sensor network; Computer science; Computer network; Population; Event (particle physics); Bridge (graph theory); Topology (electrical circuits); Distributed computing; Engineering; Physics","score_opus":0.02679933560933868,"score_gpt":0.24562200378888574,"score_spread":0.21882266817954707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039357626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12513876,0.00090215716,0.867979,0.0005585144,0.00010209632,0.00007707854,0.00007415315,0.00031611545,0.0048521473],"genre_scores_gemma":[0.8797345,0.0011272826,0.11409912,0.00016377865,0.00012017401,0.00017445107,0.00011573201,0.00011688201,0.0043480103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991308,0.00042347208,0.000027835335,0.0001296307,0.00017884653,0.000109348795],"domain_scores_gemma":[0.99785644,0.0014727282,0.0002017296,0.00014522462,0.00022452815,0.00009924827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026133275,0.00057346845,0.00072369695,0.00046723493,0.0005398183,0.00081247883,0.0016187092,0.001018126,0.0016546162],"category_scores_gemma":[0.0067223907,0.00031414372,0.0006068451,0.00078123505,0.000990197,0.0021585012,0.0012607714,0.00063500815,0.00018923412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008128305,0.000039444774,0.0017819002,0.00009897897,0.00003235773,0.000121474935,0.00012205405,0.9392992,0.0029434504,0.028434254,0.0011079247,0.025937686],"study_design_scores_gemma":[0.000006833531,0.000056215413,0.00028185738,0.0000073110195,0.000009532458,0.000036189012,0.000023200539,0.99227494,0.0007552648,0.0057471055,0.000795418,0.0000060706097],"about_ca_topic_score_codex":0.00191144,"about_ca_topic_score_gemma":0.0021154205,"teacher_disagreement_score":0.0026133275,"about_ca_system_score_codex":0.0011419256,"about_ca_system_score_gemma":0.0006891234,"threshold_uncertainty_score":0.013820708},"labels":[],"label_agreement":null},{"id":"W2040783219","doi":"10.1109/glocom.2006.854","title":"WLC41-2: Adaptive Regenerate and Forward Cooperative Diversity System based on Quadrature Signaling","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Power consumption; Computer science; Quadrature (astronomy); Cooperative diversity; Signal-to-noise ratio (imaging); Upper and lower bounds; Channel (broadcasting); Control theory (sociology); Power (physics); Topology (electrical circuits); Mathematical optimization; Electronic engineering; Telecommunications; Mathematics; Engineering; Fading; Physics; Artificial intelligence","score_opus":0.021268076425171145,"score_gpt":0.22222829303427608,"score_spread":0.20096021660910493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040783219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1250665,0.0009324286,0.8610322,0.0006964287,0.0002576727,0.0003068657,0.0001529556,0.0009268688,0.010628037],"genre_scores_gemma":[0.88380826,0.00031442242,0.11021656,0.00032704067,0.000083953186,0.0001934821,0.00015609374,0.000011866557,0.0048883166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994037,0.00017478496,0.00002861319,0.000101444304,0.0001963459,0.00009514282],"domain_scores_gemma":[0.9995146,0.0000932697,0.00006935964,0.00006145861,0.0002215634,0.00003968452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076322793,0.00048327635,0.00065218966,0.0005568585,0.00058119773,0.0008423762,0.0010739041,0.0008828646,0.001085606],"category_scores_gemma":[0.00082576997,0.0001683231,0.0002541891,0.00075796654,0.0005010845,0.00061078585,0.00067001005,0.0004381477,0.00048472593],"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.0010544586,0.0004469265,0.0045655947,0.00040380456,0.00020892681,0.0013794445,0.00041492164,0.11911592,0.34224316,0.08491117,0.011552244,0.4337034],"study_design_scores_gemma":[0.00027679183,0.0012528208,0.001351508,0.000045665663,0.00010213823,0.001294068,0.00005647617,0.9334126,0.037251193,0.0071817148,0.017677816,0.00009717123],"about_ca_topic_score_codex":0.0014071361,"about_ca_topic_score_gemma":0.0022263858,"teacher_disagreement_score":0.0014071361,"about_ca_system_score_codex":0.00040783238,"about_ca_system_score_gemma":0.00065509207,"threshold_uncertainty_score":0.004036367},"labels":[],"label_agreement":null},{"id":"W2041989762","doi":"10.1109/glocom.2006.733","title":"WLC21-1: Improved High-rate Space-Time-Frequency Block Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Queen's University","funders":"","keywords":"Physics; Computer science","score_opus":0.0037906946120488984,"score_gpt":0.19713860817463147,"score_spread":0.19334791356258257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041989762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05991521,0.002633897,0.9088498,0.00064199534,0.00035789856,0.0002029778,0.000659008,0.001554421,0.025184814],"genre_scores_gemma":[0.50575984,0.0020213362,0.46598202,0.00041593358,0.0002776966,0.0003141241,0.0017037736,0.00016037028,0.023365006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999138,0.00015474638,0.000033767323,0.00008225614,0.00047655264,0.00011458503],"domain_scores_gemma":[0.9982002,0.00044271606,0.00024470867,0.00029995808,0.00073526386,0.00007721705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008768544,0.000739283,0.00053494034,0.0010498116,0.0004106614,0.0009545293,0.0008579763,0.0009988848,0.003894188],"category_scores_gemma":[0.0031894753,0.00014909387,0.00033250882,0.0014739817,0.0004913414,0.0009475626,0.00069636275,0.0008593631,0.002045945],"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.00076184113,0.00022590774,0.0020933286,0.0003555845,0.00008114039,0.00030852674,0.00017736082,0.141269,0.10871515,0.14576587,0.014078463,0.5861678],"study_design_scores_gemma":[0.00017499461,0.0006393956,0.0021404657,0.000119559896,0.00006389719,0.0009929865,0.000040917137,0.80625874,0.08607316,0.021941738,0.08140839,0.00014571358],"about_ca_topic_score_codex":0.0024466305,"about_ca_topic_score_gemma":0.004442924,"teacher_disagreement_score":0.003894188,"about_ca_system_score_codex":0.0009416488,"about_ca_system_score_gemma":0.0015647665,"threshold_uncertainty_score":0.01302731},"labels":[],"label_agreement":null},{"id":"W2042864373","doi":"10.1109/glocom.2006.777","title":"WLC28-3: SNR Estimators for UWB BPSK Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","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 Alberta","funders":"","keywords":"Estimator; Phase-shift keying; Bandwidth (computing); Mean squared error; Computer science; Keying; Binary number; Algorithm; Bit error rate; Electronic engineering; Ultra-wideband; Mathematics; Telecommunications; Statistics; Engineering; Decoding methods","score_opus":0.004268870453155159,"score_gpt":0.18512087810689035,"score_spread":0.1808520076537352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042864373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008413679,0.0010665171,0.9889664,0.00007171051,0.000055795597,0.000027673583,0.000057183282,0.00057655666,0.00076439825],"genre_scores_gemma":[0.37677956,0.0019253917,0.6154372,0.00024510262,0.00034440268,0.00020384569,0.0005127562,0.0002636206,0.0042881602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890006,0.0003283996,0.000090536516,0.00012148932,0.00048853667,0.000070934824],"domain_scores_gemma":[0.99735475,0.001286576,0.0002736336,0.00021006884,0.0008362024,0.000038856786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023814824,0.0010048848,0.0009388537,0.00119022,0.00025126128,0.0011608513,0.00079168164,0.0011123408,0.0019733459],"category_scores_gemma":[0.008741024,0.0003781511,0.00031993326,0.0008727125,0.0004887962,0.0017188928,0.0006706985,0.0009079752,0.0013632112],"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.0007185626,0.00014785203,0.0023778488,0.00074235845,0.0001936241,0.00019454754,0.00012022509,0.22436707,0.06300642,0.023532286,0.0048801526,0.67971903],"study_design_scores_gemma":[0.000059211834,0.0002089439,0.0018468105,0.000058651785,0.00005875216,0.00029073627,0.00002067113,0.9446338,0.041079912,0.005673131,0.0060095214,0.000059960792],"about_ca_topic_score_codex":0.00046594045,"about_ca_topic_score_gemma":0.00065555854,"teacher_disagreement_score":0.0023814824,"about_ca_system_score_codex":0.00041608617,"about_ca_system_score_gemma":0.0004372073,"threshold_uncertainty_score":0.01259464},"labels":[],"label_agreement":null},{"id":"W2044052036","doi":"10.1109/glocom.2006.809","title":"WLC33-5: Second Order Statistics of Non-identical Nakagami Fading Channels with Maximal-Ratio Combining","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Fade; Fading; Envelope (radar); Independent and identically distributed random variables; Statistics; Order statistic; Correctness; Mathematics; Maximal-ratio combining; Level crossing; Sample (material); Algorithm; Computer science; Topology (electrical circuits); Telecommunications; Random variable; Physics; Combinatorics; Engineering","score_opus":0.017043265798598252,"score_gpt":0.25634433680148916,"score_spread":0.2393010710028909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044052036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05221866,0.0007965892,0.9358368,0.0001813179,0.000067085,0.000056401495,0.00013439289,0.00043302288,0.010275709],"genre_scores_gemma":[0.8966849,0.0010359408,0.09774148,0.00017260511,0.00013624752,0.000093583614,0.00031623893,0.00010552598,0.0037134362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987179,0.00037233272,0.000044770757,0.0000944798,0.00059482484,0.0001757382],"domain_scores_gemma":[0.9982741,0.0008010481,0.00029949547,0.00025464286,0.0003149975,0.000055701945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016876397,0.0009439195,0.00074973615,0.0008737589,0.00038104918,0.0015312372,0.00067794265,0.0007135348,0.0012882217],"category_scores_gemma":[0.0049118414,0.00030647704,0.00051885634,0.0017144833,0.0007962301,0.0012769914,0.0007912642,0.00080245436,0.0006888404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023345064,0.000071133305,0.003130091,0.0002664484,0.00012192493,0.0012462307,0.00029246902,0.61924297,0.025480956,0.27743757,0.0033555203,0.06912126],"study_design_scores_gemma":[0.000013273599,0.00010495781,0.0012407105,0.000022372995,0.00002902759,0.0008073927,0.000038616126,0.93954927,0.009397261,0.04540831,0.0033280868,0.000060767576],"about_ca_topic_score_codex":0.0010702983,"about_ca_topic_score_gemma":0.0012648659,"teacher_disagreement_score":0.0016876397,"about_ca_system_score_codex":0.000747837,"about_ca_system_score_gemma":0.0010151322,"threshold_uncertainty_score":0.008925259},"labels":[],"label_agreement":null},{"id":"W2045761076","doi":"10.1109/glocom.2006.822","title":"WLC35-6: Relay-Assisted Spatial Multiplexing in Wireless Fixed Relay Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Spatial multiplexing; Computer science; MIMO; Multiplexing; Computer network; Wireless; Antenna diversity; Diversity gain; Decoding methods; Electronic engineering; Telecommunications; Power (physics); Channel (broadcasting); Engineering","score_opus":0.019401949209997955,"score_gpt":0.2464339209211083,"score_spread":0.22703197171111034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045761076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09095809,0.0052280175,0.8765869,0.00070675235,0.00023718164,0.00012542069,0.00015024238,0.00048801312,0.025519378],"genre_scores_gemma":[0.9103275,0.0023162044,0.081079856,0.00012696389,0.0001346605,0.000086367174,0.00008188107,0.000029820527,0.005816745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961025,0.0001679033,0.00001377815,0.000029923624,0.00012591456,0.000052230942],"domain_scores_gemma":[0.9995795,0.00018018424,0.000058342986,0.00006126679,0.00009871483,0.000022044498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126711,0.00043471565,0.00034731498,0.0004610089,0.00032902154,0.0005836859,0.0006061563,0.00064194784,0.001562319],"category_scores_gemma":[0.0013509863,0.00011876509,0.00020496662,0.0006363322,0.00058354234,0.0005587861,0.00042331923,0.00039022218,0.0003699446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046116946,0.000078925535,0.0014561448,0.00039356857,0.000095908064,0.00074552157,0.00015319315,0.38807175,0.040615436,0.29817772,0.011216474,0.25853416],"study_design_scores_gemma":[0.000036842597,0.0003049363,0.00054281665,0.00003798156,0.00003219677,0.0005304072,0.00003243599,0.9189222,0.017827956,0.048274178,0.013421216,0.000036916314],"about_ca_topic_score_codex":0.0012212453,"about_ca_topic_score_gemma":0.00186876,"teacher_disagreement_score":0.001562319,"about_ca_system_score_codex":0.0005721369,"about_ca_system_score_gemma":0.00061612984,"threshold_uncertainty_score":0.005226493},"labels":[],"label_agreement":null},{"id":"W2047939401","doi":"10.1109/glocom.2006.111","title":"CTH14-1: On the Integrated Cross-Noise Component in Correlation Receivers","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Autocorrelation; Gaussian noise; Noise (video); Component (thermodynamics); Probability density function; SIGNAL (programming language); Cross-correlation; Convergence (economics); Gaussian; Uncorrelated; Noise measurement; Algorithm; Value noise; Statistics; Computer science; Mathematics; Noise floor; Physics; Noise reduction; Artificial intelligence","score_opus":0.006992885321791408,"score_gpt":0.20504542589527777,"score_spread":0.19805254057348637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047939401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056973887,0.0024926036,0.97634673,0.00047418798,0.0004060024,0.000052296058,0.00008969718,0.0002345057,0.014206619],"genre_scores_gemma":[0.49876103,0.00994001,0.4426498,0.0023276818,0.0031932225,0.0003374129,0.000565522,0.0010237882,0.041201547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635124,0.0013515734,0.00011698777,0.00034652618,0.0016009689,0.00023267194],"domain_scores_gemma":[0.99084514,0.0053466507,0.00052499364,0.0009711509,0.0021466222,0.00016534624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054556457,0.001827575,0.0011629979,0.0014992623,0.00083328394,0.002216341,0.0016535902,0.002432088,0.004053791],"category_scores_gemma":[0.017256916,0.0007376535,0.0010119587,0.0028592013,0.0033564172,0.0033803054,0.0018468318,0.003591375,0.001830298],"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.0004641141,0.00008075685,0.0023599619,0.00036502926,0.000140206,0.00068499637,0.00022733537,0.2550455,0.007158851,0.6224038,0.016065158,0.095004395],"study_design_scores_gemma":[0.000023057837,0.00022543441,0.00088244816,0.00017115784,0.00006258458,0.0010067186,0.000032318312,0.85983187,0.006694387,0.11508857,0.01590466,0.00007676042],"about_ca_topic_score_codex":0.0035387657,"about_ca_topic_score_gemma":0.0029970433,"teacher_disagreement_score":0.0054556457,"about_ca_system_score_codex":0.0018462595,"about_ca_system_score_gemma":0.0018803414,"threshold_uncertainty_score":0.028852522},"labels":[],"label_agreement":null},{"id":"W2048100384","doi":"10.1109/glocom.2006.760","title":"WLC25-4: Dynamic 802.15.3 WPAN Scheduling using Maximal Matching","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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 Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Asynchronous communication; Dynamic priority scheduling; Reuse; Distributed computing; Schedule; Real-time computing; Mathematical optimization; Engineering; Mathematics","score_opus":0.013281791150846796,"score_gpt":0.26212024020954494,"score_spread":0.24883844905869815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048100384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03926705,0.0003713753,0.950492,0.000166286,0.00020613555,0.00016343966,0.00012744326,0.0026602435,0.006545975],"genre_scores_gemma":[0.6697328,0.0002617827,0.32351577,0.00017908453,0.00013920182,0.00025802586,0.0003748371,0.00024353333,0.005294938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993248,0.00012248104,0.000055516124,0.00010094336,0.0002376008,0.00015878395],"domain_scores_gemma":[0.9994413,0.00007638713,0.00008186082,0.00019055314,0.0001432032,0.00006670856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505889,0.00044214935,0.0006475667,0.00082105095,0.00077528757,0.00091104815,0.0020658416,0.00042986157,0.0021752517],"category_scores_gemma":[0.0011530712,0.00024069083,0.00034359453,0.0008923231,0.0006963979,0.00077365065,0.0009583886,0.00061887916,0.00069001847],"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.00089721923,0.0003469482,0.0014324675,0.0002225811,0.00013158337,0.00025808485,0.0002611774,0.1960629,0.10344426,0.12906198,0.018330796,0.54955006],"study_design_scores_gemma":[0.000108775326,0.00020787345,0.00076377223,0.000019184794,0.000040222352,0.00015978831,0.000028763474,0.89253044,0.055543695,0.021503976,0.029041369,0.000052098076],"about_ca_topic_score_codex":0.0032698899,"about_ca_topic_score_gemma":0.003496198,"teacher_disagreement_score":0.0032698899,"about_ca_system_score_codex":0.0013442911,"about_ca_system_score_gemma":0.0016274041,"threshold_uncertainty_score":0.009753585},"labels":[],"label_agreement":null},{"id":"W2051621878","doi":"10.1109/glocom.2006.402","title":"OPN08-03: Backup Path Re-optimizations for Shared Path Protection in Multi-domain Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Optical Network 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":"Université de Montréal; Concordia University","funders":"","keywords":"Backup; Computer science; Path (computing); Distributed computing; Scalability; Computer network; Path protection; Routing (electronic design automation); Domain (mathematical analysis); Mathematics; Wavelength-division multiplexing; Operating system","score_opus":0.015431761070927606,"score_gpt":0.22572243381568208,"score_spread":0.21029067274475446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051621878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06566797,0.0005183157,0.92455095,0.00031814506,0.000074784635,0.000044740642,0.00008307093,0.0005664424,0.008175458],"genre_scores_gemma":[0.88476247,0.00025444885,0.110160135,0.000063680985,0.000029801111,0.00004722117,0.000084535386,0.000105845735,0.004491887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975795,0.00007757238,0.0000068993677,0.00003356654,0.00008292663,0.000041096548],"domain_scores_gemma":[0.9996693,0.00011129165,0.00003943087,0.000097558375,0.00006356223,0.000018829283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005092856,0.0004215552,0.0004863126,0.00024213953,0.00031469678,0.0006279172,0.0008746822,0.0005518508,0.0022858765],"category_scores_gemma":[0.0008782362,0.00021745318,0.00049152575,0.00029239914,0.0004156558,0.001215293,0.00063452445,0.0005954626,0.00023422648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059620354,0.000030692474,0.0002737587,0.000043602173,0.000019824452,0.000050483748,0.000020478068,0.95931256,0.0032619436,0.010917533,0.0015279435,0.024481544],"study_design_scores_gemma":[0.0000056931526,0.000021994496,0.000047189365,0.0000023962405,0.000002892789,0.000020224674,0.000005596743,0.9961165,0.0009030993,0.0021630523,0.00070875545,0.0000025912504],"about_ca_topic_score_codex":0.0025185966,"about_ca_topic_score_gemma":0.0035606339,"teacher_disagreement_score":0.0025185966,"about_ca_system_score_codex":0.00076569384,"about_ca_system_score_gemma":0.0008649011,"threshold_uncertainty_score":0.007646978},"labels":[],"label_agreement":null},{"id":"W2057938077","doi":"10.1109/glocom.2006.873","title":"WLC44-3: Reduced-Complexity Decoding of Raptor Codes over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fountain code; Fading; Raptor code; Decoding methods; Computer science; Luby transform code; Tornado code; Binary erasure channel; Algorithm; Erasure; Online codes; Channel (broadcasting); Theoretical computer science; Concatenated error correction code; Computer network; Block code; Channel capacity","score_opus":0.032573212726410575,"score_gpt":0.28419459446730794,"score_spread":0.2516213817408974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057938077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033648618,0.00062576163,0.95239407,0.00033803523,0.00016548333,0.00010570166,0.00019914098,0.0018656484,0.010657515],"genre_scores_gemma":[0.3809721,0.0007557318,0.60730416,0.0003254939,0.00014885401,0.00017635849,0.00035956292,0.00029885923,0.009658875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999124,0.00026701041,0.000042771604,0.00008989992,0.0003541198,0.0001222717],"domain_scores_gemma":[0.998862,0.00039476922,0.00010976986,0.0003954337,0.00020505676,0.00003289916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197796,0.00077835965,0.0007506862,0.0006972569,0.0003856573,0.0008156096,0.00071273366,0.0012593649,0.001647824],"category_scores_gemma":[0.0034626138,0.00021576337,0.00048156182,0.0007794552,0.00073507533,0.00084285915,0.00086022256,0.0011152055,0.0013762108],"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.00044512248,0.000097412325,0.0008047462,0.0002974822,0.00016898537,0.0008111329,0.0002960459,0.3521064,0.0817818,0.1575196,0.012661341,0.39300984],"study_design_scores_gemma":[0.00004536516,0.00011036037,0.0002690814,0.000036051242,0.000026200287,0.00063622906,0.000017171591,0.8878334,0.0659113,0.030798402,0.014264241,0.000052089792],"about_ca_topic_score_codex":0.0014047206,"about_ca_topic_score_gemma":0.0018126502,"teacher_disagreement_score":0.001647824,"about_ca_system_score_codex":0.00039084317,"about_ca_system_score_gemma":0.0008857977,"threshold_uncertainty_score":0.0055125356},"labels":[],"label_agreement":null},{"id":"W2061359222","doi":"10.1109/glocom.2006.1010","title":"WSNp1-5: Analysis of a New 802.11 Distributed Media Access Control Protocol","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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":"Western University","funders":"","keywords":"Distributed coordination function; Computer science; Throughput; Overhead (engineering); Reset (finance); Protocol (science); Computer network; Access control; Process (computing); Distributed computing; IEEE 802.11; Wireless; Operating system","score_opus":0.018911170265732146,"score_gpt":0.29897076324412875,"score_spread":0.2800595929783966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061359222","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.030492077,0.0012045199,0.95614856,0.00033313173,0.00025614054,0.0003341021,0.000273552,0.00085742306,0.010100505],"genre_scores_gemma":[0.65768653,0.002149424,0.32890457,0.00024222625,0.00023003877,0.00085433753,0.0007527511,0.00021601983,0.008964086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988385,0.0001580849,0.000057638004,0.00013681971,0.0007056991,0.00010329279],"domain_scores_gemma":[0.9993562,0.00022856884,0.00009200864,0.000060446484,0.0002451508,0.000017680943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010102302,0.000828151,0.00044395524,0.0010316962,0.0004018438,0.0007897504,0.0012642244,0.00062747893,0.0020773842],"category_scores_gemma":[0.0026168346,0.00029390503,0.0006335582,0.0006507269,0.0004183729,0.0014399997,0.00045302528,0.00092240557,0.00052010664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022436306,0.00013382184,0.0033531694,0.0005064849,0.0001158389,0.0006771179,0.00013204927,0.7518448,0.02904333,0.084254384,0.0046101133,0.12510458],"study_design_scores_gemma":[0.000009363088,0.00006564753,0.00038232392,0.00001360972,0.000019734232,0.00012801943,0.00000905971,0.9880264,0.0036455763,0.0026807666,0.0050081047,0.0000113805245],"about_ca_topic_score_codex":0.003952804,"about_ca_topic_score_gemma":0.002737188,"teacher_disagreement_score":0.003952804,"about_ca_system_score_codex":0.0012152016,"about_ca_system_score_gemma":0.0010591324,"threshold_uncertainty_score":0.0088169575},"labels":[],"label_agreement":null},{"id":"W2061750841","doi":"10.1109/glocom.2006.145","title":"GEN01-3: Robust Decoding for Channels with Impulse Noise","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Impulse noise; Computer science; Decoding methods; Gaussian noise; Viterbi decoder; Narrowband; Electronic engineering; Bit error rate; Noise measurement; Algorithm; Telecommunications; Engineering; Noise reduction; Artificial intelligence","score_opus":0.012217212111369856,"score_gpt":0.2059443856994251,"score_spread":0.19372717358805525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061750841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055957973,0.0003796008,0.93751407,0.00016594242,0.000028889317,0.000025721096,0.000109541375,0.00044318207,0.0053750994],"genre_scores_gemma":[0.7932291,0.00054839277,0.20047079,0.00015393781,0.000045131223,0.0000704379,0.00029618054,0.00016653047,0.0050195567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917704,0.00027137424,0.000030008627,0.00008410503,0.00032713698,0.00011033373],"domain_scores_gemma":[0.99865013,0.0008539747,0.000145786,0.00014585722,0.00018058278,0.000023664139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192201,0.00061541,0.0006085299,0.0004331969,0.00023393879,0.00086875417,0.00052523054,0.0008862566,0.0014495144],"category_scores_gemma":[0.004388845,0.00015127861,0.00028891728,0.0005133408,0.00075293577,0.000743795,0.0007259965,0.00052203995,0.0004789602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027004612,0.00002843468,0.0010046682,0.00012934225,0.000048480506,0.00015910796,0.000078701974,0.84470516,0.017122766,0.09814237,0.0010996818,0.03721122],"study_design_scores_gemma":[0.0000080603295,0.000050108454,0.00010785806,0.000010817384,0.000006148676,0.000085271495,0.0000071697714,0.9804597,0.007932125,0.010476118,0.0008481137,0.000008497344],"about_ca_topic_score_codex":0.0014315635,"about_ca_topic_score_gemma":0.0015579225,"teacher_disagreement_score":0.0014495144,"about_ca_system_score_codex":0.00076334906,"about_ca_system_score_gemma":0.0010424366,"threshold_uncertainty_score":0.006305039},"labels":[],"label_agreement":null},{"id":"W2063531717","doi":"10.1109/glocom.2006.701","title":"WLC15-4: Enhanced Per-Flow Admission Control and QoS Provisioning in IEEE 802.11e Wireless LANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Quality of service; Computer science; Computer network; Provisioning; Admission control; Wireless Multimedia Extensions; Access control; Channel (broadcasting); IEEE 802; IEEE 802.11e-2005; Call Admission Control; Resource allocation; Wireless; Wireless network; Wi-Fi array; Telecommunications","score_opus":0.0055791159151229765,"score_gpt":0.23003036839482058,"score_spread":0.2244512524796976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063531717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054191835,0.0014479462,0.93180394,0.00076013466,0.00033240506,0.00032789234,0.00008552498,0.0036776175,0.0073727146],"genre_scores_gemma":[0.72295934,0.0008207368,0.2663874,0.00052719336,0.00029104264,0.00035636305,0.00025821172,0.00015215021,0.008247494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761534,0.0006609142,0.00016017356,0.00017187114,0.001006648,0.00038497066],"domain_scores_gemma":[0.9986381,0.00030184077,0.00013659372,0.00030781518,0.0005196378,0.000096034586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003492092,0.0005944292,0.0009732632,0.0012695054,0.00074670854,0.002088961,0.0026604598,0.0012693409,0.0016328886],"category_scores_gemma":[0.0038447566,0.00032647562,0.00035829112,0.0009255233,0.0012541148,0.0018767696,0.0014328047,0.0017722162,0.00062874117],"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.0010462645,0.00056111004,0.0024527137,0.00026621023,0.00009813025,0.0004861197,0.0003657289,0.2974752,0.055819113,0.09108111,0.013225995,0.5371222],"study_design_scores_gemma":[0.000067112414,0.00014070794,0.00040110407,0.00001998053,0.000019060266,0.00010811968,0.000019521482,0.9671797,0.014645524,0.007582254,0.009773385,0.000043592616],"about_ca_topic_score_codex":0.006320267,"about_ca_topic_score_gemma":0.005172433,"teacher_disagreement_score":0.006320267,"about_ca_system_score_codex":0.00178031,"about_ca_system_score_gemma":0.002220054,"threshold_uncertainty_score":0.018468142},"labels":[],"label_agreement":null},{"id":"W2067856487","doi":"10.1109/glocom.2006.261","title":"NIS01-1: An Efficient Key Management Scheme for Heterogeneous Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Security in Wireless Sensor Networks","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":"Université du Québec","funders":"","keywords":"Wireless sensor network; Computer science; Key management; Overhead (engineering); Scheme (mathematics); Key (lock); Computer network; Distributed computing; Key distribution in wireless sensor networks; Homogeneous; Computer security; Telecommunications; Wireless network; Wireless; Encryption","score_opus":0.008986656461933522,"score_gpt":0.22726327122442055,"score_spread":0.21827661476248703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067856487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06432238,0.0017906979,0.90344304,0.0007396349,0.00042840585,0.00078191573,0.0006635862,0.003368293,0.024461979],"genre_scores_gemma":[0.79632825,0.0005717334,0.18783262,0.00030949636,0.00007969244,0.0005119031,0.0012654568,0.00010615859,0.012994662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999178,0.00020264549,0.00008139263,0.00008309324,0.00033320827,0.00012174537],"domain_scores_gemma":[0.9989807,0.00014881571,0.00014929092,0.0003525935,0.0002872169,0.000081277125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012497052,0.00048223155,0.0006844955,0.0007466915,0.00089944684,0.000753289,0.0022089689,0.00062817754,0.0026405563],"category_scores_gemma":[0.002163248,0.00020760638,0.00034071473,0.0010432687,0.00058654783,0.0024217418,0.0026027618,0.000803526,0.0011977798],"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.0023181452,0.00038089798,0.0014383756,0.0008693327,0.0001414744,0.000469217,0.00041080778,0.08992352,0.16050634,0.20924759,0.029947784,0.50434643],"study_design_scores_gemma":[0.00034956215,0.00074511947,0.001179724,0.00007029189,0.00009127801,0.0009934291,0.00015109195,0.7507681,0.10409323,0.06350751,0.07788555,0.00016506227],"about_ca_topic_score_codex":0.00060496794,"about_ca_topic_score_gemma":0.0012388823,"teacher_disagreement_score":0.0026405563,"about_ca_system_score_codex":0.0013083521,"about_ca_system_score_gemma":0.001743929,"threshold_uncertainty_score":0.009492815},"labels":[],"label_agreement":null},{"id":"W2072334110","doi":"10.1109/glocom.2006.633","title":"WLC04-1: A Distributed BER-Based Power Control Algorithm for WCDMA Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Power control; Computer science; Signal-to-interference ratio; Bit error rate; Telecommunications link; Transmitter power output; Code division multiple access; Interference (communication); Quality of service; Signal-to-noise ratio (imaging); Algorithm; Spread spectrum; Convergence (economics); Power (physics); Real-time computing; Electronic engineering; Computer network; Engineering; Telecommunications; Transmitter; Decoding methods; Channel (broadcasting)","score_opus":0.012495300912548543,"score_gpt":0.2584105794732239,"score_spread":0.24591527856067533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072334110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005375399,0.00011115005,0.99179804,0.00007485512,0.000041218067,0.00004672887,0.000016690303,0.0010487338,0.0014872153],"genre_scores_gemma":[0.25302437,0.0001582166,0.7392108,0.00017417909,0.00006886831,0.00030826157,0.00017546618,0.00023477014,0.0066452487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952495,0.000089322784,0.00002449534,0.00008481481,0.00022937528,0.000047027443],"domain_scores_gemma":[0.99918574,0.0003101693,0.00009817939,0.00008636664,0.00028650102,0.00003315029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563253,0.00082100753,0.0007314793,0.00079606776,0.00052830915,0.0008719861,0.0013024991,0.0010839718,0.0025430915],"category_scores_gemma":[0.0032525577,0.00029626736,0.00025841163,0.0006137573,0.0005463202,0.00081291446,0.00066983356,0.0011621574,0.0011610272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022586246,0.00015166625,0.00076099514,0.000120131066,0.00004106582,0.00008582425,0.000101188,0.49548548,0.011670597,0.009858802,0.00402938,0.47746897],"study_design_scores_gemma":[0.000047994385,0.000042144045,0.00015792665,0.0000063579405,0.000004375011,0.000037086862,0.000003635863,0.9939454,0.002961081,0.0012701986,0.0015163503,0.0000073759943],"about_ca_topic_score_codex":0.003666707,"about_ca_topic_score_gemma":0.003979417,"teacher_disagreement_score":0.003666707,"about_ca_system_score_codex":0.00079782284,"about_ca_system_score_gemma":0.0010919736,"threshold_uncertainty_score":0.00850749},"labels":[],"label_agreement":null},{"id":"W2073066647","doi":"10.1109/glocom.2006.309","title":"NISp1-02: Security Issues in the IEEE 802.15.3 WPANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Bluetooth and Wireless Communication Technologies","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":"Université du Québec","funders":"","keywords":"Computer science; Computer security; IEEE 802; Security analysis; IEEE 802.15; IEEE 802.11w-2009; Wireless; Wireless network; Computer network; IEEE 802.11; Telecommunications","score_opus":0.010755598412822752,"score_gpt":0.24673143735906095,"score_spread":0.2359758389462382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073066647","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.08060283,0.013937963,0.79669493,0.008913679,0.0015608474,0.00014161706,0.000121726254,0.00068651256,0.09733997],"genre_scores_gemma":[0.8348779,0.012983227,0.11441467,0.0018987656,0.0014246058,0.000162486,0.00013041854,0.00026506511,0.033842817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899787,0.000324528,0.0000617652,0.00007115071,0.00045399676,0.00009066592],"domain_scores_gemma":[0.9987388,0.0006490323,0.00012422119,0.00016628184,0.00029240732,0.000029311297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018125466,0.00063044135,0.00033661406,0.00066683633,0.0012405608,0.0024208273,0.00055049674,0.0013740356,0.0016216949],"category_scores_gemma":[0.0033133295,0.00036443595,0.0005272997,0.00055684306,0.0022230917,0.003786294,0.00070979825,0.0022836407,0.0005429317],"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.00013397042,0.000060894796,0.00161578,0.00023397479,0.00003788198,0.0009951413,0.00070691906,0.03713619,0.015002331,0.8136016,0.008325881,0.12214933],"study_design_scores_gemma":[0.000023691906,0.00021854197,0.0025738976,0.00031722191,0.00008456932,0.002808251,0.0006277527,0.26418188,0.033748057,0.5645294,0.13077796,0.00010879294],"about_ca_topic_score_codex":0.0015664666,"about_ca_topic_score_gemma":0.0013926148,"teacher_disagreement_score":0.0024208273,"about_ca_system_score_codex":0.001248472,"about_ca_system_score_gemma":0.00094622787,"threshold_uncertainty_score":0.009585798},"labels":[],"label_agreement":null},{"id":"W2073962778","doi":"10.1109/glocom.2006.717","title":"WLC18-3: Frequency-Domain Equalization Techniques for DS-UWB Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Equalization (audio); Frequency domain; Computer science; Bit error rate; Domain (mathematical analysis); Time domain; Blind equalization; Electronic engineering; Computational complexity theory; Algorithm; Mathematics; Decoding methods; Engineering","score_opus":0.007263845968909205,"score_gpt":0.21580889864764186,"score_spread":0.20854505267873266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073962778","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.10299089,0.0024500822,0.8841609,0.000261091,0.00018092316,0.00011490156,0.00015672264,0.00096812146,0.008716356],"genre_scores_gemma":[0.6992358,0.001726106,0.28262046,0.00017838962,0.00011006921,0.000108428816,0.00029973092,0.00011133163,0.015609763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998018,0.000033364002,0.000014906258,0.000018640343,0.00010346925,0.00002790247],"domain_scores_gemma":[0.99975926,0.00008234089,0.00002989274,0.00002781239,0.000094131814,0.000006546979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035364472,0.0003724649,0.00027332947,0.00042028647,0.00021756289,0.0004044067,0.00030948312,0.0004594474,0.0034971863],"category_scores_gemma":[0.00067473075,0.0000835549,0.00015714052,0.00040905224,0.00019462635,0.00048036475,0.0001607304,0.00035758066,0.00095036766],"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.00071205106,0.00018818254,0.0015046588,0.00045744303,0.00009438214,0.00025425115,0.000094530325,0.04955062,0.35903022,0.010470596,0.004467435,0.57317567],"study_design_scores_gemma":[0.00014402746,0.0010121809,0.004797167,0.00006381532,0.00006366706,0.0015296388,0.000048716724,0.46293068,0.48508948,0.003883266,0.040374223,0.00006313577],"about_ca_topic_score_codex":0.00067299616,"about_ca_topic_score_gemma":0.0009765569,"teacher_disagreement_score":0.0034971863,"about_ca_system_score_codex":0.0002251734,"about_ca_system_score_gemma":0.0002783609,"threshold_uncertainty_score":0.011699259},"labels":[],"label_agreement":null},{"id":"W2074818683","doi":"10.1109/glocom.2006.593","title":"SPC11-3: Group-Based Block Linear Successive Interference Cancellation For DS-CDMA","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Single antenna interference cancellation; Beamforming; Interference (communication); Code division multiple access; Computer science; Smart antenna; Block (permutation group theory); Multiuser detection; Electronic engineering; Computational complexity theory; Telecommunications; Algorithm; Engineering; Mathematics; Directional antenna; Antenna (radio); Decoding methods","score_opus":0.021712208850863834,"score_gpt":0.28888064626403426,"score_spread":0.2671684374131704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074818683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021103967,0.00059167825,0.96715957,0.00022835303,0.0002185132,0.0001828358,0.00009380451,0.0016929944,0.008728317],"genre_scores_gemma":[0.43351665,0.00068750273,0.5445277,0.00044309717,0.00023184282,0.0003460299,0.0005804786,0.00011495264,0.019551674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994523,0.00012238865,0.000019622992,0.00003732013,0.0003122244,0.000056119705],"domain_scores_gemma":[0.9996277,0.000071868606,0.00003987225,0.000060035192,0.00017306129,0.000027453681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031787,0.00058021257,0.00042571532,0.0004893554,0.00046315996,0.0004997479,0.000822716,0.00076530356,0.0037899397],"category_scores_gemma":[0.0007650447,0.00014437023,0.00025280373,0.0004627469,0.00037396065,0.00036928835,0.00045080413,0.00065445364,0.0022761521],"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.0008064614,0.00031944676,0.0008314889,0.00032535946,0.0001818579,0.00041519213,0.00016970771,0.06821147,0.2471897,0.026061926,0.01581394,0.6396734],"study_design_scores_gemma":[0.00018603122,0.0010373173,0.00072217,0.000023172222,0.000055077737,0.00083558867,0.00002725397,0.85009015,0.103248745,0.003811867,0.039918445,0.000044254983],"about_ca_topic_score_codex":0.0016138615,"about_ca_topic_score_gemma":0.0042250166,"teacher_disagreement_score":0.0037899397,"about_ca_system_score_codex":0.00035007982,"about_ca_system_score_gemma":0.0008520258,"threshold_uncertainty_score":0.012678564},"labels":[],"label_agreement":null},{"id":"W2078220749","doi":"10.1109/glocom.2006.443","title":"QRP05-4: Internet Traffic Identification using Machine Learning","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Internet Traffic Analysis and Secure E-voting","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 Calgary","funders":"","keywords":"Computer science; Unsupervised learning; Cluster analysis; Artificial intelligence; Machine learning; Naive Bayes classifier; Supervised learning; Identification (biology); The Internet; Internet traffic; Classifier (UML); Conceptual clustering; Data mining; Fuzzy clustering; Artificial neural network; Support vector machine; Canopy clustering algorithm","score_opus":0.012768759855586146,"score_gpt":0.23331017150130598,"score_spread":0.22054141164571983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078220749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43057176,0.000370176,0.5147109,0.0007980551,0.00039052582,0.0011280348,0.0024900022,0.02896046,0.020580104],"genre_scores_gemma":[0.57666713,0.00015562143,0.40841407,0.00025164778,0.00011817125,0.00040116924,0.0054388177,0.0003667795,0.008186627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982346,0.00068334147,0.00007650029,0.00022089003,0.0006707011,0.000113867645],"domain_scores_gemma":[0.9971246,0.00096741715,0.00024801376,0.0005924849,0.00097366254,0.000093898525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016185759,0.00067348283,0.00088228774,0.0025167323,0.0005655597,0.00078802934,0.0011664846,0.0011341063,0.0027168414],"category_scores_gemma":[0.0043807975,0.00018627105,0.0004637248,0.001485781,0.00037893056,0.0011519075,0.0005738564,0.0006558782,0.0019629446],"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.0012393105,0.002998488,0.036984395,0.0004616975,0.00038525017,0.00039335355,0.00015041864,0.15092169,0.054570135,0.006298082,0.032344576,0.7132526],"study_design_scores_gemma":[0.00009387833,0.0007267508,0.010392127,0.000012162327,0.000030238602,0.00031985773,0.000049288676,0.9366256,0.04354984,0.0021563608,0.005989497,0.0000544955],"about_ca_topic_score_codex":0.0034909688,"about_ca_topic_score_gemma":0.004066697,"teacher_disagreement_score":0.0034909688,"about_ca_system_score_codex":0.00050853856,"about_ca_system_score_gemma":0.0007057489,"threshold_uncertainty_score":0.009088755},"labels":[],"label_agreement":null},{"id":"W2079266395","doi":"10.1109/glocom.2006.43","title":"CTH02-3: Simple Concatenated Codes Using Differential PSK","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Concatenated error correction code; Algorithm; EXIT chart; Serial concatenated convolutional codes; Turbo code; Computer science; Block code; Decoding methods; Linear code; Additive white Gaussian noise; Low-density parity-check code; Theoretical computer science; Channel (broadcasting); Telecommunications","score_opus":0.011917770827242316,"score_gpt":0.24484559271418693,"score_spread":0.2329278218869446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079266395","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.3500429,0.0017562379,0.6154669,0.000484007,0.00045351495,0.00045450171,0.0007459029,0.002364805,0.028231274],"genre_scores_gemma":[0.794719,0.0003220833,0.19318421,0.00013298354,0.000107623535,0.0001205954,0.0006236895,0.00008358954,0.010706213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.000099886354,0.000034144094,0.00005558129,0.00030738334,0.000056937795],"domain_scores_gemma":[0.99900347,0.0001613041,0.00017846223,0.00027603496,0.00029147373,0.00008922571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044005475,0.00043233304,0.00037823725,0.0005194125,0.00039380792,0.0007285866,0.00058943377,0.00053549337,0.0014370688],"category_scores_gemma":[0.0012601323,0.00013787928,0.00020012238,0.0006749768,0.00057813694,0.00056958233,0.00061964494,0.00047245433,0.00073746726],"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.0022336193,0.00023786371,0.006441065,0.0005780174,0.00019215874,0.0011676595,0.00036439075,0.108521625,0.36160403,0.09281357,0.007896326,0.41794968],"study_design_scores_gemma":[0.00020518928,0.0017780336,0.0043095085,0.0000856615,0.00012520728,0.0031451976,0.000052623294,0.44982195,0.46891347,0.013250488,0.058151,0.00016162577],"about_ca_topic_score_codex":0.0012614412,"about_ca_topic_score_gemma":0.0023083328,"teacher_disagreement_score":0.0014370688,"about_ca_system_score_codex":0.0005667409,"about_ca_system_score_gemma":0.0008675754,"threshold_uncertainty_score":0.004807472},"labels":[],"label_agreement":null},{"id":"W2080699736","doi":"10.1109/glocom.2006.794","title":"WLC31-2: Capacity of MIMO Rician Fading Channels with Transmitter and Receiver Channel State Information","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Rician fading; MIMO; Transmitter; Channel state information; Fading; Channel (broadcasting); Channel capacity; Computer science; Ergodic theory; Topology (electrical circuits); Precoding; Mathematics; Telecommunications; Electronic engineering; Control theory (sociology); Wireless; Engineering; Mathematical analysis","score_opus":0.005304989565263642,"score_gpt":0.16771552703550066,"score_spread":0.162410537470237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080699736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122073635,0.003343273,0.7860932,0.0014895695,0.00015687855,0.00008578251,0.0013180465,0.0007870041,0.084652714],"genre_scores_gemma":[0.9774459,0.0015355903,0.013792564,0.00025650373,0.00014471359,0.00011914899,0.0005178474,0.00013720388,0.006050571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991904,0.00017601257,0.000021992375,0.000113705675,0.00028884193,0.00020901074],"domain_scores_gemma":[0.99776685,0.0013411407,0.00018716192,0.00020666143,0.0004448121,0.000053246404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066158,0.00074988184,0.000706547,0.0010824332,0.00035720674,0.0016445153,0.000952336,0.00087346835,0.0039538597],"category_scores_gemma":[0.004980764,0.00022135666,0.00035060165,0.0015338082,0.0016843989,0.0017585208,0.0008649342,0.0009247093,0.0008788296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007458247,0.00004580961,0.00068023225,0.00022889762,0.000025691255,0.00032727685,0.00017478601,0.6430136,0.007951258,0.31430092,0.0058003296,0.0273766],"study_design_scores_gemma":[0.0000043964865,0.000021681682,0.0006431231,0.000051260646,0.00000844812,0.00021217183,0.000040332216,0.91981804,0.0031973412,0.07363548,0.002335372,0.00003234446],"about_ca_topic_score_codex":0.002482468,"about_ca_topic_score_gemma":0.0011510135,"teacher_disagreement_score":0.0039538597,"about_ca_system_score_codex":0.0012666278,"about_ca_system_score_gemma":0.0012935441,"threshold_uncertainty_score":0.013227046},"labels":[],"label_agreement":null},{"id":"W2083185260","doi":"10.1109/glocom.2006.806","title":"WLC33-2: On Relaying in Cooperative Static Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Signal-to-noise ratio (imaging); Channel (broadcasting); Maximal-ratio combining; Outage probability; Power (physics); Electronic engineering; Computer network; Topology (electrical circuits); Telecommunications; Engineering; Fading; Electrical engineering; Physics","score_opus":0.027398959412582292,"score_gpt":0.2714228325759955,"score_spread":0.24402387316341317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083185260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09008733,0.005633977,0.8032882,0.0008605995,0.00030076702,0.00017127417,0.0002595371,0.00038214735,0.0990162],"genre_scores_gemma":[0.92958987,0.005774663,0.04704804,0.00029031027,0.00029591392,0.00017160072,0.00018811316,0.00010097377,0.016540537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.0002312586,0.000017715618,0.000058949154,0.00025397382,0.00011193947],"domain_scores_gemma":[0.9984742,0.0009164771,0.000105236824,0.00013948038,0.0003352537,0.000029378969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011174883,0.0008585799,0.0005890858,0.0009104134,0.000552614,0.00092863385,0.00066146575,0.00082214194,0.002595644],"category_scores_gemma":[0.002855475,0.0002046981,0.00041047373,0.0012144997,0.0016260667,0.0010343154,0.0008160659,0.00054990436,0.0010102465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031605223,0.00006394874,0.00070150354,0.0004821871,0.00007900556,0.0012354489,0.00041910645,0.4573063,0.029551005,0.43327755,0.011345096,0.06522286],"study_design_scores_gemma":[0.000039831728,0.00037240217,0.0006182856,0.000116062474,0.000070293805,0.0012149145,0.00012492303,0.85152924,0.013387673,0.11684633,0.015608703,0.000071330534],"about_ca_topic_score_codex":0.0021467388,"about_ca_topic_score_gemma":0.0020329219,"teacher_disagreement_score":0.002595644,"about_ca_system_score_codex":0.00102924,"about_ca_system_score_gemma":0.0006043193,"threshold_uncertainty_score":0.008683264},"labels":[],"label_agreement":null},{"id":"W2083443394","doi":"10.1109/glocom.2006.418","title":"QRP01-1: Optimal Routing of Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of Victoria","funders":"","keywords":"Bottleneck; Computer science; Heuristics; Quality of service; Computer network; Bandwidth (computing); Tabu search; Service (business); Mathematical optimization; Distributed computing; Algorithm; Mathematics","score_opus":0.002343904617799321,"score_gpt":0.17905921532048918,"score_spread":0.17671531070268987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083443394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11043267,0.00076866825,0.8521535,0.0010439521,0.00016706802,0.00045358526,0.0009164964,0.0015827476,0.032481372],"genre_scores_gemma":[0.5492143,0.0004824331,0.44223946,0.00026408985,0.000068472225,0.00019919858,0.0009392149,0.00030310033,0.006289762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987741,0.0005728084,0.0000423328,0.0001370466,0.00021158204,0.0002621022],"domain_scores_gemma":[0.9989249,0.0004895049,0.00011150603,0.00015929315,0.00024082663,0.000074066964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018327204,0.0006737518,0.00095154333,0.0011366701,0.0010626196,0.0017799684,0.001522834,0.0011300397,0.006644115],"category_scores_gemma":[0.004082969,0.00054762413,0.0005010343,0.001644253,0.0010600388,0.0013515757,0.0010687464,0.0007265249,0.0008054821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026684903,0.00012326584,0.0009021423,0.0001636646,0.000043931548,0.00009898787,0.000121486446,0.8478907,0.0029557168,0.0479957,0.011044955,0.0883927],"study_design_scores_gemma":[0.000036234916,0.00006104036,0.00018173977,0.000013400822,0.000007159446,0.000056638717,0.000046648376,0.9789039,0.0014779575,0.016113648,0.0030914994,0.00001020986],"about_ca_topic_score_codex":0.0068093757,"about_ca_topic_score_gemma":0.0062026116,"teacher_disagreement_score":0.0068093757,"about_ca_system_score_codex":0.002107316,"about_ca_system_score_gemma":0.0025971816,"threshold_uncertainty_score":0.02222675},"labels":[],"label_agreement":null},{"id":"W2095346903","doi":"10.1109/glocom.2006.799","title":"WLC32-1: ARQ for MIMO OFDM Systems with Non-Linear Preprocessing","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Automatic repeat request; Fading; Transmitter; MIMO; Channel (broadcasting); Algorithm; Selective Repeat ARQ; Transmission (telecommunications); Throughput; Channel state information; MIMO-OFDM; Hybrid automatic repeat request; Computer network; Telecommunications; Wireless","score_opus":0.008702311227695643,"score_gpt":0.23626518467503577,"score_spread":0.22756287344734014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095346903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011963579,0.00034167548,0.9822029,0.00023715112,0.000106472195,0.00016198712,0.000041576546,0.0007190552,0.004225686],"genre_scores_gemma":[0.490872,0.000698731,0.5016338,0.00037570862,0.00027605318,0.00028569732,0.00019771134,0.00011247571,0.005547776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992149,0.00016979896,0.00003119754,0.00010865857,0.00036591254,0.000109481975],"domain_scores_gemma":[0.9989706,0.000351675,0.00011064419,0.00023464716,0.0002985249,0.000033852197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092922506,0.0006227882,0.0005568537,0.00036220608,0.00052691007,0.00072805147,0.001200137,0.00063429924,0.0022750534],"category_scores_gemma":[0.0014270154,0.00023034656,0.00035631598,0.00041814227,0.0007389093,0.00088332104,0.00048621412,0.001013207,0.0012701373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005251098,0.0003076604,0.0011396009,0.00055770384,0.00010534385,0.001075069,0.00022210916,0.36494857,0.1844042,0.090047896,0.011248426,0.34541833],"study_design_scores_gemma":[0.000047742076,0.0002905245,0.0003340764,0.000016506743,0.000022261429,0.00033653065,0.000015554564,0.9711912,0.017733615,0.0038270955,0.00614907,0.00003583893],"about_ca_topic_score_codex":0.0016905908,"about_ca_topic_score_gemma":0.0034514186,"teacher_disagreement_score":0.0022750534,"about_ca_system_score_codex":0.00056094275,"about_ca_system_score_gemma":0.0012107868,"threshold_uncertainty_score":0.007610798},"labels":[],"label_agreement":null},{"id":"W2095376975","doi":"10.1109/glocom.2006.978","title":"WSN15-3: Optimal Resource Allocation for Homogeneous Wireless Multicast","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Distributed computing; Source-specific multicast; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Wireless network; Wireless ad hoc network; Asynchronous communication; Resource allocation; Wireless","score_opus":0.008572975009139411,"score_gpt":0.2243540668526798,"score_spread":0.21578109184354038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095376975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02557483,0.00025646595,0.9696233,0.0000903035,0.000028215758,0.00006969029,0.000048355814,0.00027521967,0.0040335963],"genre_scores_gemma":[0.49870482,0.00030007242,0.49777064,0.00007168388,0.00004028805,0.0002177343,0.00019070326,0.00018246105,0.0025216152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995629,0.00018004178,0.00001973445,0.00005227591,0.00012469584,0.000060293445],"domain_scores_gemma":[0.9996939,0.0001658658,0.000034406414,0.000037420432,0.000049216145,0.000019238796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014861234,0.0006088954,0.0006437574,0.00053037173,0.00042599565,0.00058542413,0.00086389424,0.000488086,0.001593124],"category_scores_gemma":[0.0021545147,0.00024346789,0.0003820941,0.000528285,0.00048605615,0.0005610946,0.0007319019,0.00034924678,0.0002947238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002295309,0.00011057191,0.0007281657,0.0001308665,0.00006222614,0.00008566194,0.00013373756,0.8131423,0.010489567,0.048726037,0.004116817,0.12204446],"study_design_scores_gemma":[0.000024826346,0.00003517431,0.00010350765,0.000005472766,0.0000052793152,0.000025624435,0.000010186059,0.98999316,0.0019064788,0.006445252,0.0014403948,0.0000047009635],"about_ca_topic_score_codex":0.0017391564,"about_ca_topic_score_gemma":0.001874461,"teacher_disagreement_score":0.0017391564,"about_ca_system_score_codex":0.00079454825,"about_ca_system_score_gemma":0.0009623221,"threshold_uncertainty_score":0.007859468},"labels":[],"label_agreement":null},{"id":"W2096017667","doi":"10.1109/glocom.2006.610","title":"SPCp1-08: Adaptive Learning of Transmission Control Policies for MIMO Fading Channels under Delay Constraint","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Markov decision process; Computer science; MIMO; Mathematical optimization; Transmission (telecommunications); Convergence (economics); Markov process; Constraint (computer-aided design); Q-learning; Transmitter; Channel (broadcasting); Power control; Reinforcement learning; Resource allocation; Wireless; Power (physics); Mathematics; Telecommunications; Computer network; Artificial intelligence; Statistics","score_opus":0.00894306168979507,"score_gpt":0.21723389741076962,"score_spread":0.20829083572097457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096017667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023351084,0.00018872332,0.97414577,0.00021803341,0.000034936216,0.000060128223,0.000033379827,0.00013042783,0.0018374776],"genre_scores_gemma":[0.9097762,0.00030900585,0.087208785,0.00016339448,0.000072343966,0.00016589447,0.00007756268,0.000044409106,0.0021824297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931204,0.00027012054,0.000028679298,0.0001305854,0.00014230446,0.000116149604],"domain_scores_gemma":[0.99684525,0.0023138737,0.00023804263,0.00015230398,0.0003456389,0.000104919556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020078525,0.00066163123,0.00089215004,0.00027785898,0.00035748183,0.00070370984,0.0009533445,0.0010541767,0.0017811303],"category_scores_gemma":[0.00699711,0.00030949432,0.00038659154,0.00045613782,0.0010059979,0.0008808375,0.0009738161,0.0013131433,0.00024512442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007570667,0.000061202634,0.0002705656,0.00004606733,0.000017492292,0.00003791083,0.000028815497,0.9649855,0.0009702901,0.010261757,0.0007051045,0.02253955],"study_design_scores_gemma":[0.00000770963,0.000021490685,0.000029014736,0.0000018398715,0.0000015204445,0.0000050502053,0.0000016570478,0.99814546,0.00021196289,0.0014845454,0.000088141045,0.0000016942142],"about_ca_topic_score_codex":0.0052362503,"about_ca_topic_score_gemma":0.003013227,"teacher_disagreement_score":0.0052362503,"about_ca_system_score_codex":0.0009570979,"about_ca_system_score_gemma":0.0020529004,"threshold_uncertainty_score":0.010618687},"labels":[],"label_agreement":null},{"id":"W2096668092","doi":"10.1109/glocom.2006.709","title":"WLC17-1: Performance Analysis of a Reservation Based Connection Admission Scheme in 802.16 Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Reservation; Wireless broadband; IEEE 802; Call Admission Control; Scheme (mathematics); IEEE 802.11e-2005; Broadband networks; Service (business); Revenue; Bandwidth (computing); Admission control; Differentiated services; Wireless network; Wireless; Broadband; Telecommunications; Mathematics","score_opus":0.006523415383979554,"score_gpt":0.20416830415924136,"score_spread":0.19764488877526182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096668092","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.60142124,0.004702218,0.35977614,0.0010557987,0.00027897887,0.00040269562,0.0003958011,0.00130339,0.03066377],"genre_scores_gemma":[0.9904935,0.00047832375,0.0073929736,0.000040292747,0.000047481713,0.00006347456,0.00009530679,0.00004493498,0.0013437765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702746,0.0008809041,0.00008821798,0.00018075918,0.0011407946,0.00068198715],"domain_scores_gemma":[0.99313414,0.004208891,0.0007114387,0.00034793507,0.0014126275,0.00018494473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042883116,0.0012570448,0.001044782,0.0018815536,0.0010004224,0.0016013096,0.0012409698,0.0008906777,0.003220792],"category_scores_gemma":[0.01158246,0.0002907662,0.0005181325,0.0018361318,0.0013564515,0.0012107557,0.0008971633,0.0010208061,0.000426833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051557884,0.00013303592,0.0034475632,0.00012221925,0.000065660264,0.00017655182,0.00010130013,0.93238634,0.008336839,0.024422217,0.0016419906,0.028650777],"study_design_scores_gemma":[0.0000062300915,0.000080275786,0.0004160469,0.0000068231097,0.000008495239,0.000036715377,0.000013416147,0.9976775,0.00081745075,0.000777839,0.000151177,0.0000080335485],"about_ca_topic_score_codex":0.013175682,"about_ca_topic_score_gemma":0.004533344,"teacher_disagreement_score":0.013175682,"about_ca_system_score_codex":0.0035532333,"about_ca_system_score_gemma":0.0022752893,"threshold_uncertainty_score":0.02619803},"labels":[],"label_agreement":null},{"id":"W2097387210","doi":"10.1109/glocom.2006.851","title":"WLC40-5: Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","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 British Columbia","funders":"","keywords":"Quality of service; Computer science; Call Admission Control; Blocking (statistics); Call blocking; Markov chain; Admission control; Markov process; Channel (broadcasting); Mathematical optimization; Computer network; Mathematics; Wireless network; Wireless; Machine learning","score_opus":0.03997982443639401,"score_gpt":0.32555945131505976,"score_spread":0.2855796268786657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097387210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011868405,0.00034808376,0.9841967,0.00011891041,0.00004813573,0.00006093405,0.0000402617,0.000445121,0.0028733267],"genre_scores_gemma":[0.55685425,0.0005527581,0.4388306,0.00015095735,0.00008167579,0.00037258014,0.00020158364,0.00027543245,0.0026801017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981345,0.0007874172,0.000058182355,0.000086958586,0.000731507,0.000201375],"domain_scores_gemma":[0.9943744,0.0040650866,0.00027637236,0.0004606654,0.0007003663,0.00012324401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037382073,0.0011968936,0.0011297007,0.001210946,0.0007805895,0.0014321854,0.0017913713,0.0016676022,0.00246577],"category_scores_gemma":[0.016384717,0.00053375564,0.0007045336,0.0010843363,0.0010684966,0.0014340585,0.0010806137,0.0020828578,0.00077591505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003829405,0.00003010838,0.0002859419,0.000030257455,0.00001079365,0.000027837445,0.00003038066,0.9742613,0.000530358,0.010555825,0.00047915085,0.013719736],"study_design_scores_gemma":[0.0000016415281,0.0000022411602,0.000014130691,0.000002714943,7.1087084e-7,0.0000024981641,0.0000019334202,0.99899775,0.00009197335,0.0008013919,0.000081681574,0.0000012863876],"about_ca_topic_score_codex":0.016101431,"about_ca_topic_score_gemma":0.008605351,"teacher_disagreement_score":0.016101431,"about_ca_system_score_codex":0.0027508617,"about_ca_system_score_gemma":0.0023550505,"threshold_uncertainty_score":0.032015383},"labels":[],"label_agreement":null},{"id":"W2098903679","doi":"10.1109/glocom.2006.687","title":"WLC13-2: Reduced-Outage-Probability Algorithms for Cross-Layer Call Admission Control in CDMA Beamforming Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Queen's University","funders":"","keywords":"Beamforming; Computer science; Power control; Telecommunications link; Code division multiple access; Outage probability; Physical layer; Context (archaeology); Algorithm; Power (physics); Computer network; Fading; Telecommunications; Wireless; Decoding methods","score_opus":0.04385464867416883,"score_gpt":0.3344374596736958,"score_spread":0.290582810999527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098903679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050546667,0.00013299473,0.9932313,0.00008291716,0.000018435623,0.000042634132,0.000022709597,0.00023197434,0.0011823748],"genre_scores_gemma":[0.31507015,0.00036241682,0.6808177,0.00015126682,0.000080643484,0.00050686894,0.00019038799,0.00017021761,0.0026502572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880576,0.00048577008,0.00007088403,0.00010526856,0.00036314072,0.00016920369],"domain_scores_gemma":[0.995624,0.003041089,0.00031162406,0.00032556517,0.00057882466,0.00011879951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022759172,0.001215748,0.001093819,0.0008907833,0.0006088719,0.0014137345,0.0016908773,0.0014359067,0.0041723223],"category_scores_gemma":[0.010219366,0.0005617999,0.00065811886,0.0009765644,0.0010040083,0.0017013913,0.0016844776,0.0022228835,0.0009236808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014708797,0.00006968568,0.00036158302,0.000078953526,0.000027089593,0.000037106125,0.00012150269,0.877534,0.0015715192,0.025441721,0.0017527895,0.092856996],"study_design_scores_gemma":[0.000012478635,0.000012390337,0.000029608886,0.00000439249,0.0000021223036,0.000007926239,0.0000041569415,0.9961061,0.00030484822,0.003251108,0.00026105007,0.0000037593825],"about_ca_topic_score_codex":0.0048188656,"about_ca_topic_score_gemma":0.0031335545,"teacher_disagreement_score":0.0048188656,"about_ca_system_score_codex":0.001418839,"about_ca_system_score_gemma":0.0019385787,"threshold_uncertainty_score":0.0139577985},"labels":[],"label_agreement":null},{"id":"W2103375672","doi":"10.1109/glocom.2006.320","title":"NXG01-3: Rate Allocation under Network End-to-End Quality-of-Service Requirements","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; End-to-end principle; Computer network; Probabilistic logic; End-to-end delay; Bandwidth (computing); Bandwidth allocation; Queue; Network delay; Queuing delay; Mathematical optimization; Network packet; Distributed computing","score_opus":0.03039839090807506,"score_gpt":0.27930735120166794,"score_spread":0.24890896029359288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103375672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04485626,0.00034365227,0.9385028,0.00086430676,0.00009223642,0.0002366047,0.000230543,0.00087624555,0.013997358],"genre_scores_gemma":[0.6627898,0.00034347546,0.3272132,0.00038109298,0.00016027897,0.00034363815,0.0004186893,0.00031865298,0.008031041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979109,0.00086530694,0.00006060536,0.00032477494,0.00051755324,0.00032084886],"domain_scores_gemma":[0.9983076,0.00079109316,0.00018525118,0.0002483682,0.00036503057,0.000102637496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034027,0.0008770725,0.0013519543,0.0004600701,0.00047266134,0.0019878726,0.0018530629,0.0016306458,0.0031376819],"category_scores_gemma":[0.006420703,0.00034569472,0.00033905846,0.00093496876,0.0010776992,0.0015610141,0.0014489037,0.0011793352,0.00086470746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032610394,0.00010229819,0.0009261702,0.00014278738,0.00004007935,0.00016100366,0.00012357159,0.8077558,0.0062584435,0.06950631,0.008791185,0.105866194],"study_design_scores_gemma":[0.000036394762,0.000064520085,0.00018690081,0.0000095107425,0.000004911648,0.00006375824,0.000016113769,0.9820133,0.0017090073,0.014008201,0.0018811151,0.0000063234056],"about_ca_topic_score_codex":0.0030513564,"about_ca_topic_score_gemma":0.0026533082,"teacher_disagreement_score":0.0034027,"about_ca_system_score_codex":0.0017143226,"about_ca_system_score_gemma":0.0019875993,"threshold_uncertainty_score":0.017995358},"labels":[],"label_agreement":null},{"id":"W2104679346","doi":"10.1109/glocom.2006.293","title":"NIS06-3: A Game Theoretic Approach to Detect Network Intrusions: The Cooperative Intruders Scenario","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Game theory; Network packet; Intrusion detection system; Router; Computer network; Node (physics); Sampling (signal processing); Distributed computing; Constraint (computer-aided design); Computer security; Engineering; Mathematics; Telecommunications; Mathematical economics","score_opus":0.008616222734882701,"score_gpt":0.2110690335392339,"score_spread":0.2024528108043512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104679346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024595153,0.00022463282,0.9604969,0.0009424685,0.000086636384,0.0003497682,0.0001189358,0.00024281908,0.012942739],"genre_scores_gemma":[0.6669922,0.00033826844,0.3252377,0.0005364661,0.000092115755,0.00039940845,0.00015753838,0.000059413982,0.006186882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960445,0.0024149509,0.00012782207,0.0003283777,0.0007896642,0.00029466907],"domain_scores_gemma":[0.9955806,0.0029569108,0.00034620333,0.0002876327,0.0005112624,0.0003174009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00442685,0.0010853233,0.001320445,0.0011178821,0.0007922443,0.0019037421,0.0029344175,0.0021685315,0.0016639488],"category_scores_gemma":[0.006694544,0.00049969053,0.0011903486,0.0008278555,0.0022676822,0.002136891,0.0017815569,0.0019703938,0.00026785157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014562607,0.0002085283,0.0011607865,0.00013111453,0.00013828248,0.00031207764,0.0001701994,0.7864424,0.0026525764,0.1880016,0.0024278904,0.018208968],"study_design_scores_gemma":[0.000019161156,0.000045462133,0.00008391075,0.0000064035594,0.000014227281,0.00006928684,0.000025850237,0.96748024,0.00047142178,0.030485203,0.0012887364,0.000010088249],"about_ca_topic_score_codex":0.0047305035,"about_ca_topic_score_gemma":0.004764701,"teacher_disagreement_score":0.0047305035,"about_ca_system_score_codex":0.002550238,"about_ca_system_score_gemma":0.0027013922,"threshold_uncertainty_score":0.023411691},"labels":[],"label_agreement":null},{"id":"W2105054553","doi":"10.1109/glocom.2006.488","title":"WSN05-1: A Dual Busy-Tone MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Dual (grammatical number); Scheme (mathematics); Tone (literature); Wireless; Telecommunications","score_opus":0.020796519274252162,"score_gpt":0.2905020568914703,"score_spread":0.26970553761721816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105054553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19641405,0.0036123975,0.7820044,0.00043042487,0.0007315663,0.00055393076,0.00027933164,0.0026048792,0.013369149],"genre_scores_gemma":[0.7836794,0.0011169644,0.205569,0.00024565568,0.00019946577,0.00029383224,0.00053660484,0.00009634668,0.008262736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996854,0.00008569627,0.00003555497,0.000039617975,0.000111179834,0.000042625375],"domain_scores_gemma":[0.99948066,0.000093847375,0.00008484924,0.000103990795,0.000165433,0.00007136538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108104,0.00046694846,0.0003807948,0.0006441683,0.00052060635,0.00055351754,0.000936982,0.00038977584,0.0010678463],"category_scores_gemma":[0.0010403497,0.00018973606,0.00023706634,0.00037407526,0.0005778238,0.00079582125,0.00089037226,0.00063710014,0.0004158195],"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.0013835285,0.0005860981,0.0035867866,0.0010859201,0.00016939687,0.00062021764,0.00070877466,0.021763599,0.36788657,0.05147012,0.011107353,0.5396316],"study_design_scores_gemma":[0.0006199607,0.004399172,0.007017064,0.00018419579,0.00033455205,0.0043020593,0.0002991501,0.6103271,0.21319509,0.02178521,0.13724734,0.00028918378],"about_ca_topic_score_codex":0.0004255102,"about_ca_topic_score_gemma":0.00079301087,"teacher_disagreement_score":0.00108104,"about_ca_system_score_codex":0.00036665317,"about_ca_system_score_gemma":0.0005803237,"threshold_uncertainty_score":0.0057170987},"labels":[],"label_agreement":null},{"id":"W2107043707","doi":"10.1109/glocom.2006.707","title":"WLC16-4: Low-Complexity Turbo Equalization for Alamouti Space-Time Block Coded EDGE Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space–time block code; Computer science; Turbo code; Algorithm; Convolutional code; Turbo; MIMO; Block code; Equalization (audio); Decoding methods; Bit error rate; Fading; Spectral efficiency; Enhanced Data Rates for GSM Evolution; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.016017114974753336,"score_gpt":0.24307899905729566,"score_spread":0.22706188408254233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107043707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038092118,0.0010481203,0.95216596,0.00021570889,0.00012660558,0.00009924345,0.0000783905,0.0008925533,0.0072812275],"genre_scores_gemma":[0.6335055,0.00080888835,0.35084686,0.00019245637,0.00012531462,0.00013371579,0.00025015988,0.000058303674,0.014078848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995534,0.00011011834,0.000032058917,0.000039130224,0.0001966585,0.00006870641],"domain_scores_gemma":[0.9994972,0.00012189791,0.000071422386,0.00006237251,0.00022549932,0.00002167455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050746964,0.0006292237,0.00044051744,0.0005176103,0.00052305224,0.00064807304,0.0007862849,0.0009077953,0.0032020707],"category_scores_gemma":[0.0010035895,0.00018167983,0.0003106718,0.000479507,0.0004659862,0.00058517285,0.0004441229,0.000583722,0.0015171791],"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.0008697357,0.00020206357,0.0030043582,0.0004063253,0.0001842983,0.00066832884,0.00027843437,0.22083783,0.1985386,0.02832447,0.007827462,0.5388581],"study_design_scores_gemma":[0.00005134743,0.00035873594,0.0008683948,0.000033199507,0.000035907666,0.00051463547,0.00002533847,0.91113436,0.07465721,0.0018787361,0.010386117,0.00005608347],"about_ca_topic_score_codex":0.002943829,"about_ca_topic_score_gemma":0.0056021097,"teacher_disagreement_score":0.0032020707,"about_ca_system_score_codex":0.0004808036,"about_ca_system_score_gemma":0.0012839339,"threshold_uncertainty_score":0.010712028},"labels":[],"label_agreement":null},{"id":"W2107893226","doi":"10.1109/glocom.2006.855","title":"WLC41-3: On the Performance of Cooperative Wireless Fixed Relays in Asymmetric Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Computer network; Reliability (semiconductor); Wireless; Node (physics); Wireless network; Outage probability; Signal strength; Expression (computer science); Relay channel; Bit error rate; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Engineering; Electrical engineering; Power (physics); Fading","score_opus":0.0250920193219738,"score_gpt":0.24538923958885522,"score_spread":0.22029722026688142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107893226","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.68190885,0.0025159298,0.28131035,0.00064191397,0.00011122044,0.00015651513,0.00041394046,0.0005267983,0.03241452],"genre_scores_gemma":[0.99298894,0.00037941308,0.0054814336,0.00004064699,0.00001575399,0.00002989288,0.00006436979,0.00003112491,0.00096844585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981501,0.00075431954,0.000036419187,0.00012329199,0.00057129754,0.0003645771],"domain_scores_gemma":[0.9877187,0.008730629,0.0007944936,0.0007405339,0.0018247727,0.00019076685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034667165,0.0010571575,0.00096435513,0.00089116197,0.000542162,0.00096494646,0.0009232523,0.0011637615,0.0014174702],"category_scores_gemma":[0.015122714,0.00024139545,0.00042762308,0.0011903334,0.0015282335,0.0009996821,0.0011357139,0.00068335125,0.00036842874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003492771,0.000053586573,0.0011802157,0.00009328986,0.00004407012,0.00019282845,0.00008582462,0.9683051,0.004126343,0.012033971,0.0010556468,0.012479873],"study_design_scores_gemma":[0.000013612195,0.00016097998,0.0003629773,0.000013236556,0.000012307496,0.00008025181,0.00003111337,0.9941214,0.0019621837,0.003018771,0.00020867692,0.000014452098],"about_ca_topic_score_codex":0.005887858,"about_ca_topic_score_gemma":0.0031069356,"teacher_disagreement_score":0.005887858,"about_ca_system_score_codex":0.0014064595,"about_ca_system_score_gemma":0.00097440067,"threshold_uncertainty_score":0.018333912},"labels":[],"label_agreement":null},{"id":"W2110919149","doi":"10.1109/glocom.2006.365","title":"OPN02-2: Inter-Group Shared Protection (I-GSP): A Scalable Solution for Survivable WDM Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Optical Network Technologies","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 Waterloo","funders":"","keywords":"Scalability; Computer science; Integer programming; Linear programming; Routing (electronic design automation); Distributed computing; Computer network; Upper and lower bounds; Scheme (mathematics); Integer (computer science); Wavelength-division multiplexing; Path (computing); Mathematical optimization; Mathematics; Algorithm","score_opus":0.011024601558332889,"score_gpt":0.20488982435621084,"score_spread":0.19386522279787793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110919149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029949466,0.00024559672,0.96283716,0.00037751003,0.00004966859,0.00008652564,0.000080140824,0.00046312314,0.0059109386],"genre_scores_gemma":[0.71063876,0.0003802496,0.28185105,0.00012130198,0.00008295674,0.00015034022,0.0002573245,0.00010274834,0.006415271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996978,0.00007420809,0.000008834066,0.000053114607,0.000109074346,0.00005709005],"domain_scores_gemma":[0.9998604,0.000034186247,0.000023373772,0.000035020556,0.00003330092,0.000013760388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057012466,0.0004011568,0.00035060418,0.0002237916,0.00036740457,0.000610503,0.0010566033,0.0005623697,0.002108002],"category_scores_gemma":[0.0004403661,0.00014180198,0.00032110914,0.00042941532,0.0005740503,0.001294667,0.0008555684,0.0007148938,0.00026668984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015687181,0.0001614916,0.0006012915,0.00024312067,0.00005848972,0.00029518368,0.000120671175,0.5436049,0.026663197,0.09793708,0.010186141,0.31997156],"study_design_scores_gemma":[0.000033981756,0.00013340772,0.00019868423,0.0000101522255,0.000011229905,0.00012645831,0.000036102567,0.9557773,0.009767376,0.02568631,0.008207286,0.000011738283],"about_ca_topic_score_codex":0.0012625722,"about_ca_topic_score_gemma":0.0018002396,"teacher_disagreement_score":0.002108002,"about_ca_system_score_codex":0.0006663472,"about_ca_system_score_gemma":0.0011193975,"threshold_uncertainty_score":0.0070520043},"labels":[],"label_agreement":null},{"id":"W2113774834","doi":"10.1109/glocom.2006.1011","title":"WSNp1-6: Applying Peer-to-Peer Asynchronous Publish Subscribe Message Middleware to Mobile Ah Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Asynchronous communication; Mobile ad hoc network; Middleware (distributed applications); Wireless ad hoc network; Node (physics); Network packet; Message oriented middleware; Distributed computing; Message broker; Message passing; Mobile computing; Wireless; Operating system; Software architecture","score_opus":0.012065312311818682,"score_gpt":0.2307891886440039,"score_spread":0.21872387633218524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113774834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01116562,0.0005925095,0.97633505,0.000267068,0.00025504644,0.00045514663,0.00006940114,0.007203918,0.0036562628],"genre_scores_gemma":[0.21293905,0.0014840425,0.77692455,0.00017330526,0.00024470768,0.00045366507,0.0005608639,0.00045047834,0.0067693666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.00030930177,0.00012429978,0.00012212437,0.00047813627,0.00007479388],"domain_scores_gemma":[0.9993468,0.00015115134,0.00007738541,0.00020009617,0.0001636903,0.000060810868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042408,0.0005880604,0.00062963046,0.00081796397,0.0005463637,0.0012720368,0.0021361227,0.00082374434,0.001514893],"category_scores_gemma":[0.0028572255,0.00037462093,0.000532827,0.0007882381,0.00055505923,0.0015980493,0.0016243189,0.0010342248,0.0010613151],"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.0003990446,0.00049884117,0.0037321348,0.0016394986,0.0003425178,0.0014103102,0.0006525295,0.07648396,0.11562897,0.0631414,0.016185384,0.71988547],"study_design_scores_gemma":[0.0002783973,0.0009135624,0.0020164996,0.00011636911,0.00021187493,0.0018777049,0.00021628177,0.6629989,0.09774876,0.036573302,0.19691968,0.00012862156],"about_ca_topic_score_codex":0.00069689314,"about_ca_topic_score_gemma":0.00060592615,"teacher_disagreement_score":0.0021361227,"about_ca_system_score_codex":0.0004075879,"about_ca_system_score_gemma":0.00074789644,"threshold_uncertainty_score":0.0108014345},"labels":[],"label_agreement":null},{"id":"W2116958798","doi":"10.1109/glocom.2006.127","title":"CTH16-5: On Selecting the Number of Receiver Diversity Antennas in Ricean Fading Cochannel Interference","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Interference (communication); Maximal-ratio combining; Signal-to-interference ratio; Antenna (radio); Bit error rate; Computer science; Electronic engineering; Antenna diversity; Diversity combining; Diversity gain; Signal-to-noise ratio (imaging); Power (physics); Telecommunications; Mathematics; Engineering; Physics","score_opus":0.01091214499077551,"score_gpt":0.220901513383937,"score_spread":0.20998936839316149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116958798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18048555,0.0040487424,0.7765906,0.0010255447,0.00022054455,0.0002618286,0.00026736775,0.0006110282,0.03648881],"genre_scores_gemma":[0.7958384,0.001033348,0.19934988,0.0002459527,0.00013364822,0.00011092682,0.0001423568,0.000060556424,0.003084901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982444,0.0009738156,0.00008152545,0.00011801539,0.00037163732,0.00021063455],"domain_scores_gemma":[0.99429554,0.004065924,0.00048308793,0.00042901628,0.0005908855,0.00013547807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027639777,0.0010712561,0.0011271144,0.00072752574,0.00040279308,0.0008634503,0.0013000638,0.0009989837,0.0026121668],"category_scores_gemma":[0.009431272,0.00032130082,0.0002652523,0.0010354937,0.0012102806,0.00086051313,0.0008905254,0.0005419398,0.0006957391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017204428,0.00013032842,0.0055371197,0.0005008345,0.00014535776,0.0004700384,0.000091536385,0.70207894,0.026488472,0.026578505,0.005825655,0.23043267],"study_design_scores_gemma":[0.00017527961,0.00076490757,0.002178117,0.0001290699,0.00006806866,0.0005208968,0.00006807346,0.95582783,0.018446634,0.017782066,0.003975108,0.00006399259],"about_ca_topic_score_codex":0.0018115056,"about_ca_topic_score_gemma":0.0032077972,"teacher_disagreement_score":0.0027639777,"about_ca_system_score_codex":0.0009065545,"about_ca_system_score_gemma":0.001037294,"threshold_uncertainty_score":0.014617443},"labels":[],"label_agreement":null},{"id":"W2120504056","doi":"10.1109/glocom.2006.544","title":"SPC03-1: On Decoding, Mutual Information, and Antenna Selection Diversity for Quasi-Orthogonal STBC with Minimum Decoding Complexity","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computer science; Block code; Code (set theory); Algorithm; List decoding; Space–time block code; Selection (genetic algorithm); Theoretical computer science; Artificial intelligence; Concatenated error correction code","score_opus":0.016816892028235254,"score_gpt":0.23017986332708687,"score_spread":0.21336297129885162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120504056","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.011055447,0.002349679,0.9325474,0.0015161852,0.00048473774,0.0002242214,0.0004855528,0.00070302864,0.050633658],"genre_scores_gemma":[0.46491027,0.0068312795,0.48121643,0.0018051362,0.0023594943,0.0010891666,0.001985555,0.0009822489,0.038820393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964269,0.0012175298,0.00011574526,0.0003368294,0.0015582648,0.0003447819],"domain_scores_gemma":[0.9969511,0.0015001851,0.00016973591,0.0005231182,0.0007624158,0.00009351849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022874626,0.0022274198,0.00176216,0.0010007084,0.0010606252,0.0027429915,0.001887908,0.0020177595,0.008244191],"category_scores_gemma":[0.00785441,0.0006498298,0.0009900904,0.0022739843,0.0021531682,0.0022792642,0.0026373824,0.002639302,0.003375982],"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.0004630294,0.00013117753,0.0005809806,0.00038414318,0.00010580473,0.00037986154,0.00023128398,0.22217236,0.010610515,0.5831826,0.040096637,0.14166163],"study_design_scores_gemma":[0.0000684321,0.0001737743,0.00020055448,0.00009669626,0.000026343327,0.0003033822,0.00002697581,0.81842786,0.004883689,0.15615807,0.019574217,0.000059988386],"about_ca_topic_score_codex":0.0042381147,"about_ca_topic_score_gemma":0.0049153245,"teacher_disagreement_score":0.008244191,"about_ca_system_score_codex":0.0026860319,"about_ca_system_score_gemma":0.004569921,"threshold_uncertainty_score":0.027579546},"labels":[],"label_agreement":null},{"id":"W2122062742","doi":"10.1109/glocom.2006.921","title":"WLCp2-10: Configurable Acknowledgment Delay (CAD) Mechanism for Asymmetric Space-Internet Links","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; CAD; The Internet; Channel (broadcasting); Mechanism (biology); Throughput; Computer network; Telecommunications; Wireless; Engineering","score_opus":0.010154925712233,"score_gpt":0.22084814556312668,"score_spread":0.21069321985089368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122062742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42307967,0.0017735062,0.5273424,0.0006863516,0.0010642667,0.0017235578,0.00081346807,0.02973482,0.013781998],"genre_scores_gemma":[0.9678674,0.00016015825,0.029297957,0.00017108563,0.000111163536,0.00026190522,0.00026070978,0.00016208942,0.0017076257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.00020689341,0.00014843183,0.0001604597,0.00036935552,0.00024034343],"domain_scores_gemma":[0.9949314,0.0011961763,0.0009794815,0.0013568421,0.0010944552,0.0004416669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024706915,0.0009993312,0.0006113045,0.0021469195,0.00088910694,0.0015281927,0.003357564,0.00092856534,0.0026624508],"category_scores_gemma":[0.00531813,0.00038508436,0.0002729144,0.0008578426,0.00084898836,0.0016542822,0.0013276404,0.0014109806,0.0005078043],"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.0057765413,0.0022158206,0.030500377,0.0014164516,0.00038170864,0.0025138531,0.00096346036,0.05324112,0.33058968,0.04760096,0.030372452,0.49442753],"study_design_scores_gemma":[0.0012179597,0.0036279364,0.01195186,0.00013317067,0.00036407026,0.004366911,0.0002587711,0.4961744,0.41338912,0.009061321,0.05889021,0.0005643528],"about_ca_topic_score_codex":0.0011033524,"about_ca_topic_score_gemma":0.0010342095,"teacher_disagreement_score":0.003357564,"about_ca_system_score_codex":0.0010339554,"about_ca_system_score_gemma":0.00090378127,"threshold_uncertainty_score":0.013066411},"labels":[],"label_agreement":null},{"id":"W2123414183","doi":"10.1109/glocom.2006.79","title":"CTH08-5: Efficient Encoding and Termination of Low-Density Parity-Check Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Low-density parity-check code; Computer science; Algorithm; Convolutional code; Encoding (memory); Serial concatenated convolutional codes; Block code; Code (set theory); Computational complexity theory; Decoding methods; Linear code; Theoretical computer science; Artificial intelligence","score_opus":0.0077699166176391395,"score_gpt":0.2334236396745022,"score_spread":0.22565372305686304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123414183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06961058,0.0005912847,0.91009927,0.00023410522,0.00016054163,0.00024460073,0.000517118,0.0028114778,0.015731074],"genre_scores_gemma":[0.53500104,0.00044445295,0.44664752,0.0001483088,0.00008739803,0.0002155694,0.0017824565,0.00022286286,0.015450368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.00007896033,0.000025108464,0.00003377051,0.00023208593,0.00005461864],"domain_scores_gemma":[0.9993093,0.00018095926,0.00006876343,0.00015488116,0.00025593684,0.00003025226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062651234,0.00040097005,0.00032506033,0.00055209437,0.0003983775,0.0005642295,0.0006416307,0.00053921284,0.0020761073],"category_scores_gemma":[0.00168849,0.00011123885,0.0001850478,0.0005622949,0.00039865653,0.00044911163,0.0004732368,0.0005806437,0.00076601346],"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.00085089187,0.00015772373,0.0024252068,0.0003770495,0.00006110509,0.00075549295,0.00019276058,0.13381863,0.18541764,0.11724838,0.021667656,0.5370274],"study_design_scores_gemma":[0.000109596505,0.00033852932,0.0009193632,0.00004925779,0.000026078736,0.00060259254,0.000016552547,0.6974043,0.2592119,0.012674218,0.028604172,0.00004343189],"about_ca_topic_score_codex":0.0018319391,"about_ca_topic_score_gemma":0.0021595727,"teacher_disagreement_score":0.0020761073,"about_ca_system_score_codex":0.0006804019,"about_ca_system_score_gemma":0.0012432347,"threshold_uncertainty_score":0.006945312},"labels":[],"label_agreement":null},{"id":"W2123959614","doi":"10.1109/glocom.2006.28","title":"CAM04-5: Toward Understanding the Behavior of BGP During Large-Scale Power Outages","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"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":"Blackout; Computer science; Computer network; Prefix; Routing protocol; The Internet; Metric (unit); Border Gateway Protocol; Routing (electronic design automation); Network mapping; Distributed computing; Power (physics); Computer security; Static routing; Electric power system; Engineering; World Wide Web","score_opus":0.01302629165740183,"score_gpt":0.21943234846117934,"score_spread":0.20640605680377752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123959614","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.92718714,0.00051339593,0.06270051,0.00095250015,0.000046935642,0.00006913088,0.0021636442,0.0010236354,0.005343103],"genre_scores_gemma":[0.9813949,0.00021137262,0.016180387,0.00009065128,0.00003978856,0.000036896694,0.0014941281,0.00006165395,0.00049028196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997844,0.00006729155,0.000011805017,0.00004247547,0.00006362571,0.000030436611],"domain_scores_gemma":[0.9977452,0.00077087147,0.00060421374,0.00035433535,0.00041327742,0.00011201656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088298524,0.00046976414,0.0004412601,0.001243754,0.00040266002,0.0010695813,0.0006412786,0.000977573,0.0011377014],"category_scores_gemma":[0.0054545878,0.00019312956,0.0001800232,0.0016338145,0.00050104817,0.0019002461,0.00039182452,0.0007597078,0.00024038306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037081446,0.00046158073,0.35909796,0.00032040218,0.00018395272,0.0006078733,0.0011077034,0.47498176,0.028255137,0.029636465,0.015160001,0.08981635],"study_design_scores_gemma":[0.000015631438,0.00009819417,0.08709058,0.00001993454,0.000017276374,0.00011183421,0.00019856112,0.8980102,0.0039373003,0.007932571,0.0025483344,0.000019593319],"about_ca_topic_score_codex":0.019088987,"about_ca_topic_score_gemma":0.019839076,"teacher_disagreement_score":0.019088987,"about_ca_system_score_codex":0.0008396715,"about_ca_system_score_gemma":0.000489275,"threshold_uncertainty_score":0.03795576},"labels":[],"label_agreement":null},{"id":"W2124008741","doi":"10.1109/glocom.2006.798","title":"WLC31-6: Performance Analysis of Multiuser MIMO CDMA Systems in Fast-Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Code division multiple access; Multiuser detection; Computer science; Base station; MIMO; Electronic engineering; Fading distribution; Interference (communication); Diversity scheme; Channel (broadcasting); Channel state information; Transmit diversity; Telecommunications; Engineering; Wireless; Rayleigh fading","score_opus":0.02172007756425612,"score_gpt":0.26920409665511025,"score_spread":0.24748401909085413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124008741","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.64287317,0.0045590485,0.31998223,0.0007708858,0.00011365865,0.000086125576,0.00042091924,0.0006728651,0.030521162],"genre_scores_gemma":[0.99222785,0.00043160003,0.0057626306,0.00004986513,0.000028608085,0.000017349214,0.00009181691,0.00003222668,0.0013579894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986987,0.00033076247,0.000029970814,0.00007621348,0.0005916165,0.0002726752],"domain_scores_gemma":[0.9951079,0.002879058,0.0004455495,0.0002892436,0.0011749575,0.00010323787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018339657,0.0007948709,0.0006120778,0.0010870053,0.00051659276,0.001215326,0.0004491174,0.0009428936,0.0024458193],"category_scores_gemma":[0.005806032,0.00021739639,0.0003259,0.0010552458,0.00079649844,0.00077379844,0.0007272093,0.00054850534,0.0005347114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001771283,0.000035048815,0.002701411,0.00010359161,0.00005304361,0.0002310206,0.00006706581,0.9589472,0.0109423315,0.009953904,0.000738984,0.016049268],"study_design_scores_gemma":[0.0000038769526,0.00006504316,0.0010792788,0.000008348151,0.000006677311,0.00009484966,0.00001601654,0.9952502,0.002144541,0.0011107334,0.00020877545,0.000011563939],"about_ca_topic_score_codex":0.0055957325,"about_ca_topic_score_gemma":0.0040242914,"teacher_disagreement_score":0.0055957325,"about_ca_system_score_codex":0.0014115154,"about_ca_system_score_gemma":0.0010278171,"threshold_uncertainty_score":0.011126339},"labels":[],"label_agreement":null},{"id":"W2124448858","doi":"10.1109/glocom.2006.957","title":"WSN11-6: Throughput Performance of Cooperative Diversity in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Throughput; Cooperative diversity; Relay; Wireless ad hoc network; Blocking (statistics); Fading; Mobile ad hoc network; Diversity gain; Protocol (science); Transmission (telecommunications); Optimized Link State Routing Protocol; Interference (communication); Distributed computing; Wireless; Routing protocol; Telecommunications; Network packet; Channel (broadcasting)","score_opus":0.02444884634170552,"score_gpt":0.2521722302363591,"score_spread":0.22772338389465357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124448858","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.7968027,0.00327538,0.18798275,0.0003875998,0.00013170068,0.00006143933,0.00026866503,0.0010224358,0.010067343],"genre_scores_gemma":[0.991979,0.00035536053,0.00673449,0.000017667962,0.000017040882,0.000021064245,0.00012871606,0.00003862775,0.0007081184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897885,0.00032034182,0.000045020966,0.000103105536,0.00043324145,0.00011944334],"domain_scores_gemma":[0.99772984,0.0012011565,0.00023665577,0.00024298127,0.00053302094,0.00005638947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018467508,0.00067992427,0.000509049,0.00059586123,0.00034664053,0.00055099354,0.0005006092,0.0005558017,0.0007758593],"category_scores_gemma":[0.0042055114,0.00015153617,0.00024576753,0.0008159649,0.00053525553,0.00070566917,0.0004793429,0.00039242543,0.00025107065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011680401,0.00028070027,0.0075684125,0.00038647375,0.00019522423,0.00051798334,0.00035658118,0.80302393,0.07723118,0.009162729,0.0030439578,0.09706471],"study_design_scores_gemma":[0.000026886653,0.0009851998,0.004104408,0.000026275724,0.000045679593,0.0003545909,0.00006923563,0.95333576,0.036931988,0.0026840528,0.0014006398,0.000035279507],"about_ca_topic_score_codex":0.0011473311,"about_ca_topic_score_gemma":0.00088885106,"teacher_disagreement_score":0.0018467508,"about_ca_system_score_codex":0.00073637697,"about_ca_system_score_gemma":0.00045003774,"threshold_uncertainty_score":0.009766638},"labels":[],"label_agreement":null},{"id":"W2125909126","doi":"10.1109/glocom.2006.992","title":"WSN17-5: A Novel Admission Control for Asynchronous Active Link Protected Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Asynchronous communication; Wireless ad hoc network; Quality of service; Power control; Admission control; Computer network; Convergence (economics); Distributed computing; Algorithm; Power (physics); Wireless","score_opus":0.01740020952178397,"score_gpt":0.27214640560205877,"score_spread":0.2547461960802748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125909126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012241142,0.0003437657,0.98238015,0.00013436573,0.0003147981,0.00015308622,0.00003799075,0.001530704,0.0028640027],"genre_scores_gemma":[0.5426073,0.0006639906,0.44723287,0.00029307813,0.00045737598,0.00039121744,0.00028466748,0.00019677689,0.0078727165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906415,0.00016953016,0.00007988815,0.00014633324,0.00044975782,0.000090419875],"domain_scores_gemma":[0.9994306,0.00014991956,0.00008620009,0.00010037057,0.00015081123,0.000082010585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079142174,0.0005487624,0.0005839051,0.0007381749,0.0006464047,0.0010554217,0.0018163733,0.0006551426,0.0018364281],"category_scores_gemma":[0.0017623621,0.00018242295,0.00042790466,0.00058700144,0.0006496118,0.0011629409,0.0014421798,0.0012553816,0.0005667898],"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.00057200075,0.0003827082,0.0024678896,0.00038583382,0.00015782696,0.0005674192,0.00042528182,0.16949877,0.07331273,0.11155373,0.009510843,0.63116497],"study_design_scores_gemma":[0.000094340234,0.00026574114,0.0004780545,0.00002522253,0.000049463873,0.00037381702,0.000032103188,0.9489908,0.014374547,0.01106028,0.024202123,0.000053553274],"about_ca_topic_score_codex":0.0013330259,"about_ca_topic_score_gemma":0.0012280295,"teacher_disagreement_score":0.0018364281,"about_ca_system_score_codex":0.0005958865,"about_ca_system_score_gemma":0.00083660666,"threshold_uncertainty_score":0.0061434507},"labels":[],"label_agreement":null},{"id":"W2128002369","doi":"10.1109/glocom.2006.149","title":"GEN02-1: Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Optical Network 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 Toronto","funders":"","keywords":"Nash equilibrium; Game theory; Mathematical optimization; Computer science; Iterative method; Best response; Constraint (computer-aided design); Channel (broadcasting); Normal-form game; Algorithm; Mathematics; Repeated game; Mathematical economics; Telecommunications","score_opus":0.006190928254146906,"score_gpt":0.2106949013831338,"score_spread":0.20450397312898688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128002369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006578547,0.00004345016,0.9873612,0.00008925918,0.000015101034,0.000109421155,0.000033646364,0.00027740386,0.005491932],"genre_scores_gemma":[0.29916355,0.00008835901,0.694935,0.00019120071,0.00002617708,0.00057959557,0.00015899118,0.00013524352,0.0047218497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991678,0.0003291706,0.000030108222,0.00011865748,0.0002128541,0.000141425],"domain_scores_gemma":[0.99872607,0.00081647915,0.000090203874,0.00009087156,0.0001999307,0.000076395896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017305409,0.0010539026,0.0011903765,0.0007232946,0.0006885372,0.0009841889,0.002031545,0.0014203564,0.0059580347],"category_scores_gemma":[0.004115206,0.00056960434,0.0006582211,0.0005707429,0.001070538,0.0011297195,0.0025386044,0.001274251,0.0010178374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001069294,0.00006855023,0.0005655926,0.00007303547,0.0000299107,0.000087155626,0.00014931538,0.8928445,0.0013370543,0.057867832,0.0019569525,0.04491318],"study_design_scores_gemma":[0.000018100834,0.000015414033,0.00002099069,0.0000042229694,0.0000025773513,0.0000082309125,0.000008756015,0.9927834,0.00017899538,0.0065183183,0.00043733005,0.0000036293345],"about_ca_topic_score_codex":0.0068967934,"about_ca_topic_score_gemma":0.009111252,"teacher_disagreement_score":0.0068967934,"about_ca_system_score_codex":0.0016429096,"about_ca_system_score_gemma":0.0027768484,"threshold_uncertainty_score":0.019931555},"labels":[],"label_agreement":null},{"id":"W2129431522","doi":"10.1109/glocom.2006.673","title":"WLC10-6: Higher Layer Performance Study of Power-Controlled Hierarchical Constellation-Based Multi-user Opportunistic Scheduling","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Round-robin scheduling; Network packet; Computer network; Real-time computing; Queueing theory; Fair-share scheduling; Distributed computing; Mathematical optimization; Mathematics; Quality of service","score_opus":0.014775687259093546,"score_gpt":0.23286438515197744,"score_spread":0.2180886978928839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129431522","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.6240977,0.00073089794,0.36323878,0.00032793471,0.00007160768,0.00014111225,0.00014234032,0.000684536,0.010565091],"genre_scores_gemma":[0.9918429,0.000062723615,0.007696331,0.000020454367,0.0000067846045,0.000014126986,0.000021471184,0.000013011188,0.00032214777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998747,0.00037360165,0.000042144013,0.000107234024,0.00041010987,0.00031988072],"domain_scores_gemma":[0.99436814,0.0034581716,0.00052395137,0.0005194492,0.00094174186,0.00018851171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019382447,0.00054724864,0.0006195785,0.00072078855,0.00051226205,0.0007769635,0.00093446655,0.00043111914,0.0017189638],"category_scores_gemma":[0.0077879126,0.00019303472,0.0002509699,0.000940398,0.00064954004,0.0008610676,0.0006886386,0.00048625492,0.00014559757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003695737,0.00014335533,0.0032667813,0.000090067624,0.00006698085,0.00019105287,0.00010214111,0.94791514,0.010000755,0.011044829,0.00090807077,0.025901262],"study_design_scores_gemma":[0.0000055151995,0.00006813407,0.00037206005,0.0000022869342,0.0000049043706,0.000025854806,0.000015476391,0.99726677,0.0014970467,0.0006318603,0.00010457406,0.0000054065094],"about_ca_topic_score_codex":0.009294114,"about_ca_topic_score_gemma":0.0044743125,"teacher_disagreement_score":0.009294114,"about_ca_system_score_codex":0.0015772659,"about_ca_system_score_gemma":0.0013322447,"threshold_uncertainty_score":0.018480062},"labels":[],"label_agreement":null},{"id":"W2129989347","doi":"10.1109/glocom.2006.482","title":"WSN04-1: Deployment for Information Oriented Sensing Coverage in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Wireless sensor network; Software deployment; Computer science; Key distribution in wireless sensor networks; Wireless; Mobile wireless sensor network; Field (mathematics); Real-time computing; Computer network; Wireless network; Distributed computing; Telecommunications","score_opus":0.005216369165350171,"score_gpt":0.20200087988342708,"score_spread":0.1967845107180769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129989347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481516,0.00220018,0.9673153,0.0005755074,0.00021317425,0.00030205186,0.00019394304,0.0016438328,0.012074391],"genre_scores_gemma":[0.37300286,0.0034709952,0.614632,0.00030575445,0.0001716301,0.0006193391,0.0010230538,0.00045337816,0.0063210796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990103,0.00031812306,0.000057371883,0.00013516734,0.00041198934,0.00006701679],"domain_scores_gemma":[0.9993845,0.00019389448,0.00011637347,0.000106336025,0.00015430366,0.000044570257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662545,0.00095747085,0.00054308336,0.0010533339,0.00060361763,0.0007155648,0.0012992251,0.0009017083,0.001973114],"category_scores_gemma":[0.0027568357,0.00033404634,0.0004508673,0.0013810114,0.0007755517,0.0012572142,0.0012603692,0.0007427453,0.00075999676],"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.00034641774,0.00018142886,0.00372861,0.0011539322,0.00011163881,0.00044278236,0.0003168989,0.28163892,0.038579073,0.13464853,0.02878962,0.5100622],"study_design_scores_gemma":[0.000088598776,0.00072978786,0.0034608934,0.00021926944,0.00007572294,0.0015605271,0.000106633204,0.85247135,0.03095881,0.026621224,0.083637886,0.000069363596],"about_ca_topic_score_codex":0.0012740344,"about_ca_topic_score_gemma":0.0013344021,"teacher_disagreement_score":0.001973114,"about_ca_system_score_codex":0.0009994169,"about_ca_system_score_gemma":0.0006960104,"threshold_uncertainty_score":0.0072513223},"labels":[],"label_agreement":null},{"id":"W2132334733","doi":"10.1109/glocom.2006.618","title":"WLC01-4: MIMO Precoder Design Based on Spatial and Path Correlation Information for Frequency-Selective Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Spatial correlation; Fading; Precoding; Channel (broadcasting); Path (computing); Uncorrelated; Channel capacity; Algorithm; Computer science; Correlation; Mathematics; Path loss; Topology (electrical circuits); Control theory (sociology); Electronic engineering; Telecommunications; Statistics; Engineering; Wireless; Computer network; Artificial intelligence; Geometry","score_opus":0.006626735969828236,"score_gpt":0.19207043379357563,"score_spread":0.1854436978237474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132334733","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.023312407,0.00014252089,0.97373223,0.00008890952,0.000039154955,0.000058884474,0.00006383394,0.00017887689,0.0023831015],"genre_scores_gemma":[0.48507392,0.00047769002,0.5094943,0.00018092075,0.00013620657,0.00012763844,0.00028100554,0.000046897432,0.0041814814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00008418854,0.000021562862,0.00007388166,0.0001275879,0.000045144265],"domain_scores_gemma":[0.9993874,0.00017582598,0.000079246594,0.00009983984,0.00022854787,0.000029219997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004446499,0.00060951867,0.00041588547,0.00032086245,0.00032145434,0.0004708374,0.0005502184,0.00055792875,0.0012018048],"category_scores_gemma":[0.0013364627,0.00028098654,0.00026788836,0.0005428313,0.00039767267,0.00054618064,0.0003509337,0.0004180753,0.00046492554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043117127,0.00018020198,0.0017877553,0.00032210376,0.00014134265,0.00035914802,0.00016191938,0.453363,0.22295879,0.03660826,0.0036634146,0.28002286],"study_design_scores_gemma":[0.000051291405,0.0004952847,0.00093698426,0.000022597647,0.00005347131,0.0003837365,0.000025247273,0.9250919,0.062815905,0.003979584,0.006105053,0.000038886705],"about_ca_topic_score_codex":0.0014267694,"about_ca_topic_score_gemma":0.004078355,"teacher_disagreement_score":0.0014267694,"about_ca_system_score_codex":0.0003364883,"about_ca_system_score_gemma":0.0010641783,"threshold_uncertainty_score":0.0040204525},"labels":[],"label_agreement":null},{"id":"W2133798603","doi":"10.1109/glocom.2006.265","title":"NIS01-5: A Novel Voting Mechanism for Compromised Node Revocation in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","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 Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Node (physics); Revocation; Computer security; Mobile ad hoc network; Wireless; Engineering; Telecommunications; Network packet; Overhead (engineering)","score_opus":0.012599220609024553,"score_gpt":0.22932695867421815,"score_spread":0.2167277380651936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133798603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076251194,0.0007796655,0.90502715,0.00039478284,0.00066555466,0.00084542664,0.00014212432,0.0052875914,0.010606585],"genre_scores_gemma":[0.8451493,0.00027800046,0.14332908,0.00034564076,0.0001413222,0.00039005745,0.00035615562,0.00015987137,0.009850578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751925,0.0007444739,0.00027396207,0.0003195164,0.0008338953,0.0003088165],"domain_scores_gemma":[0.9965243,0.0009030021,0.00048562328,0.0010180912,0.0008224108,0.0002465574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030933334,0.0005180106,0.0009865989,0.0012322812,0.0009874795,0.0010677476,0.004200985,0.0012951702,0.0026096224],"category_scores_gemma":[0.0064039635,0.00026282528,0.00051830866,0.00074131653,0.0009807635,0.0024176857,0.0023103424,0.0011984297,0.00090809166],"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.0021884802,0.00092953834,0.0072948234,0.0006671491,0.00031783935,0.0011149483,0.00080226414,0.07527773,0.13407768,0.10306289,0.016288625,0.65797806],"study_design_scores_gemma":[0.00030077767,0.0015493351,0.0017858392,0.000074066455,0.00019928435,0.0016696395,0.0001760064,0.8566187,0.06491328,0.023745248,0.04879468,0.00017326677],"about_ca_topic_score_codex":0.00079194113,"about_ca_topic_score_gemma":0.0014511296,"teacher_disagreement_score":0.004200985,"about_ca_system_score_codex":0.0007531608,"about_ca_system_score_gemma":0.0011152119,"threshold_uncertainty_score":0.01635927},"labels":[],"label_agreement":null},{"id":"W2134166585","doi":"10.1109/glocom.2006.864","title":"WLC42-6: Non-Linear Precoding for OFDM Systems in Spatially-Correlated Frequency-Selective Fading MIMO Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Precoding; Fading; Orthogonal frequency-division multiplexing; MIMO; Transmitter; MIMO-OFDM; Channel (broadcasting); Zero-forcing precoding; Computer science; Spatial correlation; Electronic engineering; Control theory (sociology); Channel state information; Telecommunications; Engineering; Wireless","score_opus":0.009497136022408759,"score_gpt":0.22356467940193409,"score_spread":0.21406754337952533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134166585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01167591,0.00025008837,0.98525846,0.00009997112,0.00006501548,0.00003075812,0.000037064423,0.00011413838,0.0024685403],"genre_scores_gemma":[0.49896592,0.001003063,0.48932576,0.00026631032,0.00021794243,0.00014147,0.00023851583,0.00007370222,0.009767244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964166,0.00010887493,0.000018187644,0.00004841738,0.00015080062,0.000032005657],"domain_scores_gemma":[0.9995846,0.00014538348,0.000051023064,0.00007413079,0.00013155275,0.000013372008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822081,0.0005604308,0.0004200351,0.00019672324,0.00028339282,0.0005521649,0.00042966002,0.00051194185,0.0015017269],"category_scores_gemma":[0.0012592707,0.00014330728,0.00023037796,0.00042320383,0.0004596559,0.0005124557,0.00036955014,0.00045414036,0.0005072888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022925323,0.00012618545,0.000933225,0.00040116668,0.00010140098,0.00039123493,0.00017747833,0.49849173,0.08098868,0.075998306,0.006682851,0.33547854],"study_design_scores_gemma":[0.000019413374,0.00015645308,0.0002886818,0.00001754612,0.00001358362,0.00015604567,0.000017183786,0.9717675,0.017842758,0.0051952493,0.004511348,0.0000142253875],"about_ca_topic_score_codex":0.0010096268,"about_ca_topic_score_gemma":0.0029396007,"teacher_disagreement_score":0.0015017269,"about_ca_system_score_codex":0.0002862383,"about_ca_system_score_gemma":0.0007339865,"threshold_uncertainty_score":0.005023837},"labels":[],"label_agreement":null},{"id":"W2136804070","doi":"10.1109/glocom.2006.666","title":"WLC09-5: Outage and Error Rate of Cellular Systems Using MRC in the Presence of Multiple Interferers and Correlated Rayleigh Fading","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Maximal-ratio combining; Interference (communication); Fading; Phase-shift keying; Mathematics; Signal-to-noise ratio (imaging); Bit error rate; Statistics; Carrier-to-noise ratio; Electronic engineering; Algorithm; Telecommunications; Computer science; Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.03566997457825327,"score_gpt":0.26993111526056873,"score_spread":0.23426114068231546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136804070","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.78886616,0.003187398,0.18644795,0.0007161234,0.000088940484,0.00010172803,0.0016172084,0.001259186,0.017715292],"genre_scores_gemma":[0.99397695,0.00033925875,0.0047659,0.00003028106,0.000018234607,0.0000225699,0.0003211973,0.000029195646,0.00049640646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712116,0.001093603,0.00013555672,0.00016168364,0.0010393381,0.00044869055],"domain_scores_gemma":[0.9841666,0.012048645,0.0010448702,0.0008707262,0.0017299225,0.00013925655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042456696,0.000882162,0.0012292484,0.0013976131,0.0004642352,0.0011277555,0.00091882376,0.0010792202,0.0014587465],"category_scores_gemma":[0.01635834,0.00027534922,0.00042686984,0.00174165,0.0012262628,0.0010075321,0.001028203,0.0004998234,0.0003414462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005497317,0.00006532386,0.006492984,0.0002634827,0.00015713912,0.00062855013,0.000120884295,0.9512075,0.005792232,0.00851531,0.0018671502,0.02433967],"study_design_scores_gemma":[0.000020909025,0.00019725737,0.003918809,0.000034252178,0.00006464968,0.00041626403,0.00006234541,0.98477995,0.0077744895,0.0022530237,0.00044340515,0.0000347169],"about_ca_topic_score_codex":0.0060169445,"about_ca_topic_score_gemma":0.0049187536,"teacher_disagreement_score":0.0060169445,"about_ca_system_score_codex":0.0017208732,"about_ca_system_score_gemma":0.000983025,"threshold_uncertainty_score":0.022453487},"labels":[],"label_agreement":null},{"id":"W2138511162","doi":"10.1109/glocom.2006.952","title":"WSN11-1: Distributed Cross-Layer Optimization of Wireless Sensor Networks: A Game Theoretic Approach","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Toronto","funders":"","keywords":"Cross-layer optimization; Computer science; Mathematical optimization; Nash equilibrium; Physical layer; Layer (electronics); Optimization problem; Dual (grammatical number); Distributed computing; Wireless sensor network; Process (computing); Stability (learning theory); Set (abstract data type); Distributed algorithm; Wireless; Wireless network; Computer network; Mathematics; Algorithm; Telecommunications","score_opus":0.00556253653233551,"score_gpt":0.20820420437680368,"score_spread":0.20264166784446816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138511162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032037634,0.00018706983,0.9936551,0.00020637702,0.000030743795,0.000032148997,0.000014874386,0.00002699261,0.0026429272],"genre_scores_gemma":[0.5424571,0.0015496432,0.44709402,0.0003638022,0.00018806093,0.00042389173,0.000103427636,0.0001179895,0.0077020973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989536,0.0005946124,0.00003201201,0.00011580969,0.0002349757,0.00006893925],"domain_scores_gemma":[0.9994785,0.0003092965,0.000053364914,0.00003972315,0.00008392021,0.00003521203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019460149,0.0012213355,0.00081940327,0.00046679733,0.00040508056,0.0011607595,0.0013346582,0.00100174,0.0012573046],"category_scores_gemma":[0.0015461618,0.00043177596,0.0009110854,0.0006021375,0.00129427,0.0013270855,0.0015073122,0.0014461929,0.00018928215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021585407,0.000041427284,0.00013387848,0.00006956043,0.000044055905,0.000047884067,0.000039014507,0.8883631,0.0016559043,0.09796499,0.0007979103,0.010820696],"study_design_scores_gemma":[0.000008329961,0.000025353162,0.00004171579,0.0000060313528,0.00000766216,0.000017732085,0.0000098629935,0.97849303,0.00031466893,0.019816991,0.0012536885,0.00000489112],"about_ca_topic_score_codex":0.0015055083,"about_ca_topic_score_gemma":0.0017753121,"teacher_disagreement_score":0.0019460149,"about_ca_system_score_codex":0.0011560902,"about_ca_system_score_gemma":0.001356157,"threshold_uncertainty_score":0.010291636},"labels":[],"label_agreement":null},{"id":"W2139517527","doi":"10.1109/glocom.2006.489","title":"WSN05-2: Distributed Medium Access Control in Pulse-Based Time-Hopping UWB Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless; Time-hopping; Frame (networking); Ultra-wideband; Distributed algorithm; Transmission (telecommunications); Wireless sensor network; Wireless network; Access control; Communication source; Distributed computing; Pulse (music); Telecommunications; Pulse-amplitude modulation","score_opus":0.004667674310808734,"score_gpt":0.2027009196458525,"score_spread":0.19803324533504377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139517527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012783512,0.0021116452,0.97620744,0.00027080765,0.00040397176,0.00012389234,0.000043160664,0.00064068235,0.007414867],"genre_scores_gemma":[0.5341819,0.003941348,0.4366113,0.0005026385,0.00063070917,0.00064559147,0.00060557784,0.00020583085,0.02267516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991702,0.00023083299,0.00006463812,0.00013018839,0.00034985688,0.000054310975],"domain_scores_gemma":[0.9995701,0.00014124748,0.000046074874,0.00007578755,0.0001356787,0.000031097334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014513936,0.00045057343,0.0004272474,0.0004328276,0.00039365137,0.0009438188,0.0010986186,0.0007616074,0.0013831075],"category_scores_gemma":[0.0015700549,0.0001917605,0.00031097524,0.0005643435,0.0006068268,0.00084780325,0.0005993933,0.000882347,0.00046245937],"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.0006929659,0.00034729097,0.0022794956,0.00085518265,0.00019408009,0.00067459233,0.00041494073,0.20597185,0.06630907,0.18330193,0.015899101,0.5230595],"study_design_scores_gemma":[0.00014668833,0.00057583704,0.0007824276,0.00007405866,0.00006665384,0.00058862247,0.000054671524,0.8729391,0.034241434,0.016178176,0.07430998,0.000042270494],"about_ca_topic_score_codex":0.00091759715,"about_ca_topic_score_gemma":0.0009601064,"teacher_disagreement_score":0.0014513936,"about_ca_system_score_codex":0.0005180916,"about_ca_system_score_gemma":0.00067027163,"threshold_uncertainty_score":0.007675767},"labels":[],"label_agreement":null},{"id":"W2139970961","doi":"10.1109/glocom.2006.137","title":"CTHp1-3: A Simple Integral Form of Lognormal Characteristic Functions Convenient for Numerical Computation","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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":"Computation; Log-normal distribution; Simple (philosophy); Characteristic function (probability theory); Function (biology); Numerical integration; Mathematics; Applied mathematics; Expression (computer science); Closed-form expression; Numerical analysis; Computer science; Probability density function; Mathematical analysis; Algorithm; Statistics","score_opus":0.005415059572164994,"score_gpt":0.23080531262897028,"score_spread":0.2253902530568053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139970961","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.001996456,0.00021997477,0.9878798,0.000095470845,0.00010818975,0.000039506307,0.00011532599,0.0004047958,0.009140528],"genre_scores_gemma":[0.2302622,0.0017619462,0.73760813,0.00045758366,0.00036911454,0.00032822276,0.00074889674,0.0012784512,0.02718545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995926,0.00006163986,0.000017476737,0.000043168842,0.00025276028,0.000032322845],"domain_scores_gemma":[0.99914825,0.0002636193,0.000081396494,0.00014016734,0.00032992347,0.000036717855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208789,0.00067233614,0.0004263237,0.00088321586,0.0004072964,0.0015596754,0.0011901254,0.0009556686,0.007792804],"category_scores_gemma":[0.004436494,0.00020998598,0.0004394557,0.0012956242,0.00075691415,0.0016929375,0.0007453361,0.0014756578,0.00385863],"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.00011210059,0.000074734795,0.0009980694,0.0003212644,0.000026138732,0.0005065104,0.00022052065,0.12094133,0.03223225,0.6569154,0.02354154,0.16411012],"study_design_scores_gemma":[0.000016481583,0.000035730383,0.0005215913,0.000056390047,0.000011961357,0.0009631692,0.000049554194,0.8200356,0.0061516445,0.13233389,0.039775204,0.000048772577],"about_ca_topic_score_codex":0.0015081831,"about_ca_topic_score_gemma":0.0018167322,"teacher_disagreement_score":0.007792804,"about_ca_system_score_codex":0.0007314382,"about_ca_system_score_gemma":0.0011812464,"threshold_uncertainty_score":0.026069522},"labels":[],"label_agreement":null},{"id":"W2141426766","doi":"10.1109/glocom.2006.574","title":"SPC08-1: An Adaptive-Scaling Tone Reservation Algorithm for PAR Reduction in OFDM Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Clipper (electronics); Orthogonal frequency-division multiplexing; Algorithm; Computer science; Reduction (mathematics); Clipping (morphology); Reservation; Computational complexity theory; Scaling; Tone (literature); Mathematics; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Computer network","score_opus":0.021808346853552905,"score_gpt":0.26139859356401135,"score_spread":0.23959024671045845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141426766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012596245,0.00022997688,0.9834298,0.00012162395,0.00010617905,0.00009937816,0.00003435082,0.0007333068,0.0026491138],"genre_scores_gemma":[0.21497844,0.0002555104,0.7795586,0.00017206682,0.00016701482,0.00022690892,0.00018479487,0.00013669091,0.004319908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995859,0.00009790281,0.000022766155,0.00006106651,0.0001991327,0.000033279208],"domain_scores_gemma":[0.9994536,0.00017339307,0.00004763378,0.000095245625,0.00020050287,0.000029624704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736562,0.00057945953,0.00045543746,0.00064542005,0.00055765547,0.00059624895,0.0010767095,0.0005679649,0.0027151753],"category_scores_gemma":[0.0019337125,0.00018235845,0.00029789907,0.0006479875,0.00046088942,0.0006642339,0.0005527581,0.000842436,0.00083844585],"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.0005106321,0.00020585764,0.00086160505,0.00013971172,0.0000714439,0.00016417005,0.00015144303,0.078275725,0.06006025,0.017861769,0.0120652,0.8296322],"study_design_scores_gemma":[0.000100637364,0.0002524581,0.00050344557,0.0000124677545,0.000023330558,0.00028422955,0.000021597189,0.95638067,0.027260996,0.0023366166,0.012788336,0.0000353073],"about_ca_topic_score_codex":0.0014158814,"about_ca_topic_score_gemma":0.0024820806,"teacher_disagreement_score":0.0027151753,"about_ca_system_score_codex":0.00039717616,"about_ca_system_score_gemma":0.0009103565,"threshold_uncertainty_score":0.009083152},"labels":[],"label_agreement":null},{"id":"W2141975720","doi":"10.1109/glocom.2006.932","title":"WSN02-2: Adaptive Network Resource Management in IEEE 802.11 Wireless Random Access MAC","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Quality of service; Wireless network; Resource management (computing); Random access; Distributed computing; Wireless; Telecommunications","score_opus":0.01692017319709029,"score_gpt":0.25860530064437004,"score_spread":0.24168512744727974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141975720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020735677,0.00068022177,0.97353643,0.00012944159,0.00009616657,0.00009426914,0.00001732763,0.0010508208,0.0036597427],"genre_scores_gemma":[0.74681205,0.00079635775,0.24668203,0.0001867214,0.00016001589,0.00028384587,0.00009718958,0.00008897184,0.004892843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993886,0.0002569148,0.000037940823,0.00008175227,0.00018243285,0.000052472158],"domain_scores_gemma":[0.9996227,0.00014350127,0.00005164504,0.000065689645,0.00010430913,0.0000121861085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010813628,0.00043866943,0.00029677083,0.00032946162,0.00023765703,0.00047799395,0.0008496908,0.00040625848,0.00074289076],"category_scores_gemma":[0.001567329,0.00016329427,0.00022129947,0.00025382804,0.00040825692,0.0005943737,0.00038272984,0.0006139872,0.00023197044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043383223,0.00018745386,0.0023883872,0.0002921482,0.0001335417,0.0004400197,0.00031825242,0.4334787,0.074523576,0.08449315,0.006368027,0.39694282],"study_design_scores_gemma":[0.000028941668,0.00017576835,0.00033773744,0.000011890602,0.000023850305,0.0001356574,0.000010832507,0.98230714,0.007822557,0.0031097531,0.0060203876,0.000015460719],"about_ca_topic_score_codex":0.0009742555,"about_ca_topic_score_gemma":0.001222603,"teacher_disagreement_score":0.0010813628,"about_ca_system_score_codex":0.0003160992,"about_ca_system_score_gemma":0.00034576558,"threshold_uncertainty_score":0.005718887},"labels":[],"label_agreement":null},{"id":"W2142059412","doi":"10.1109/glocom.2006.249","title":"NGL02-1: Multi-Stage Investment Decision under Contingent Demand for Networking Planning","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Bell (Canada); University of Waterloo","funders":"","keywords":"Stochastic programming; Investment (military); Computer science; Operations research; The Internet; Service (business); Investment decisions; Process (computing); Plan (archaeology); Installation; Business; Mathematical optimization; Production (economics); Economics; Engineering; Microeconomics; Marketing","score_opus":0.044006623806988505,"score_gpt":0.2933518968994105,"score_spread":0.249345273092422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142059412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13501838,0.00046773365,0.8311568,0.0032057867,0.00015089422,0.0005351683,0.0010098607,0.0003121923,0.028143153],"genre_scores_gemma":[0.90713495,0.00038071937,0.076086596,0.00019457673,0.00009608832,0.00047166718,0.00035300863,0.000077707016,0.015204629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979498,0.0011840834,0.00005065858,0.00022206349,0.00021179102,0.00038171644],"domain_scores_gemma":[0.9950759,0.0038441175,0.0003402112,0.00010546662,0.00030837313,0.00032588156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048366,0.0011773154,0.0016264096,0.00084116904,0.0007717156,0.0026213885,0.0018594691,0.0032498273,0.008220762],"category_scores_gemma":[0.0070900708,0.001247811,0.0011860422,0.00089650403,0.0015811748,0.0020895158,0.0016642214,0.0020475248,0.00050988625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011267679,0.00004827933,0.0004351717,0.000041929892,0.000019589981,0.00015134928,0.000038858405,0.96823746,0.00018984737,0.026829777,0.00083225634,0.0030628128],"study_design_scores_gemma":[0.00001484403,0.00002399131,0.000077509176,0.000005276065,0.000005114045,0.000009730321,0.000011788317,0.9942417,0.00007180325,0.005242019,0.00028950433,0.000006781182],"about_ca_topic_score_codex":0.017440686,"about_ca_topic_score_gemma":0.0131608425,"teacher_disagreement_score":0.017440686,"about_ca_system_score_codex":0.004073475,"about_ca_system_score_gemma":0.0033853545,"threshold_uncertainty_score":0.03467834},"labels":[],"label_agreement":null},{"id":"W2142743095","doi":"10.1109/glocom.2006.711","title":"WLC17-3: Performance of IEEE802.16 Random Access Protocol - Transient Queueing Analysis","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network 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":"Computer science; Computer network; Retransmission; Random access; Exponential backoff; Queueing theory; Orthogonal frequency-division multiple access; Code division multiple access; Queue; Real-time computing; Orthogonal frequency-division multiplexing; Throughput; Network packet; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.005882493184886254,"score_gpt":0.23656939638632618,"score_spread":0.23068690320143992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142743095","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.7267927,0.0021777656,0.24864277,0.0006139343,0.00021503102,0.00014082257,0.00057833025,0.0029631706,0.017875494],"genre_scores_gemma":[0.9935215,0.00015953725,0.0049026744,0.000039248032,0.000020116295,0.000027719268,0.00016893825,0.00008986723,0.0010704749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983424,0.00045279588,0.000052084168,0.00018189668,0.00044679994,0.0005240256],"domain_scores_gemma":[0.9961726,0.0019244313,0.00034810044,0.00030429167,0.0011202944,0.00013032198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200935,0.00086191966,0.00078925275,0.00081986253,0.000552991,0.0010645995,0.0010059745,0.0007242558,0.002652103],"category_scores_gemma":[0.0066893743,0.000170093,0.00052561914,0.00085078576,0.0007461815,0.0011623784,0.0005948617,0.00061744393,0.00043818925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005562366,0.00023003173,0.0037082192,0.00011502195,0.00007305894,0.00020180052,0.000071940194,0.94501054,0.010635317,0.015253986,0.0032040114,0.020939764],"study_design_scores_gemma":[0.0000060922007,0.00005795696,0.0004463164,0.0000035586158,0.0000061265528,0.000018017454,0.000010840902,0.9972952,0.0014619309,0.0005935933,0.000093561124,0.000006754503],"about_ca_topic_score_codex":0.0149134025,"about_ca_topic_score_gemma":0.004192653,"teacher_disagreement_score":0.0149134025,"about_ca_system_score_codex":0.0020096085,"about_ca_system_score_gemma":0.0018615146,"threshold_uncertainty_score":0.029653192},"labels":[],"label_agreement":null},{"id":"W2143082264","doi":"10.1109/glocom.2006.224","title":"MMC05-4: On the Optimality of Threshold Scheduling Policies for Video Transmission in Markovian Fading Wireless Channels with Channel-Aware ARQ","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Scheduling (production processes); Network packet; Markov decision process; Computer network; Markov process; Hybrid automatic repeat request; Wireless; Channel (broadcasting); Mathematical optimization; Automatic repeat request; Transmission (telecommunications); Real-time computing; Mathematics; Telecommunications","score_opus":0.01158624219229102,"score_gpt":0.22072065439865168,"score_spread":0.20913441220636067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143082264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06558607,0.0012427083,0.9179624,0.0011620946,0.00014619695,0.00013644336,0.00019249874,0.00019123475,0.013380482],"genre_scores_gemma":[0.90903926,0.0016478399,0.08537861,0.0002927954,0.00017793741,0.00020931149,0.00015845291,0.00018720988,0.0029086033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985868,0.0006876574,0.000049997107,0.00013451632,0.00026284947,0.00027819182],"domain_scores_gemma":[0.9893015,0.008648097,0.0007264292,0.00023375562,0.00075858907,0.00033167622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038401112,0.0013107393,0.0016725337,0.00091870286,0.0006264276,0.0019786393,0.0011651419,0.0012605865,0.0030862277],"category_scores_gemma":[0.012630109,0.0005568566,0.0008103897,0.0011787561,0.0019387825,0.002079764,0.0013431995,0.001690862,0.0003004175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011459486,0.00007466607,0.00027377537,0.00011271004,0.000035006633,0.00006014167,0.000051763596,0.91484725,0.001300139,0.07447692,0.0018637435,0.006789314],"study_design_scores_gemma":[0.000013337604,0.00003534631,0.000062863415,0.000013379722,0.000005506628,0.000009772314,0.000009706627,0.9861297,0.00032090303,0.013170242,0.00022397665,0.000005249813],"about_ca_topic_score_codex":0.0063317623,"about_ca_topic_score_gemma":0.0024228883,"teacher_disagreement_score":0.0063317623,"about_ca_system_score_codex":0.002739687,"about_ca_system_score_gemma":0.003769985,"threshold_uncertainty_score":0.020308673},"labels":[],"label_agreement":null},{"id":"W2143516379","doi":"10.1109/glocom.2006.504","title":"WSN07-5: Performance of Directional MAC Protocols in Ad-Hoc Networks over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc 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":"Concordia University","funders":"","keywords":"Computer science; Fading; Computer network; Directional antenna; Throughput; Additive white Gaussian noise; Wireless ad hoc network; Omnidirectional antenna; Channel (broadcasting); Transmission (telecommunications); Mobile ad hoc network; Antenna (radio); Wireless; Telecommunications; Network packet","score_opus":0.010105763568384897,"score_gpt":0.24281592680255232,"score_spread":0.23271016323416743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143516379","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.93195873,0.0024724985,0.056295708,0.00023882199,0.00016025173,0.00010292296,0.00040641963,0.0011990374,0.0071656583],"genre_scores_gemma":[0.9880894,0.0004962825,0.010232558,0.000042737793,0.000016017351,0.000039382638,0.00041138535,0.00004574775,0.0006265706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983708,0.00056656724,0.00013485568,0.00011932636,0.00064414827,0.00016429172],"domain_scores_gemma":[0.99707186,0.0015907371,0.00027819106,0.0002793526,0.0006539364,0.00012593041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031661883,0.0008109628,0.0004695439,0.00082145986,0.00039367896,0.0006542619,0.00043339512,0.00048578583,0.0007496857],"category_scores_gemma":[0.006045894,0.00016423524,0.0002176187,0.0007954517,0.000458902,0.0006725781,0.00062365126,0.00033573018,0.00018819717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031890322,0.0006865467,0.028960275,0.00065903616,0.0003494268,0.0004010158,0.00036192255,0.73074096,0.063280806,0.006254332,0.0061750356,0.1589416],"study_design_scores_gemma":[0.00007172597,0.0027406784,0.009332246,0.000042971827,0.0000853398,0.0003848491,0.00015357927,0.94641286,0.036685538,0.0016363005,0.0024098256,0.000044041415],"about_ca_topic_score_codex":0.0016114165,"about_ca_topic_score_gemma":0.0014253808,"teacher_disagreement_score":0.0031661883,"about_ca_system_score_codex":0.0006220556,"about_ca_system_score_gemma":0.00052913086,"threshold_uncertainty_score":0.016744554},"labels":[],"label_agreement":null},{"id":"W2143548765","doi":"10.1109/glocom.2006.779","title":"WLC28-5: Impact of Frequency Offset and Timing Offset on the Performance of SC-FDE UWB","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Carrier frequency offset; Frequency offset; SC-FDE; Offset (computer science); Computer science; Sampling (signal processing); Orthogonal frequency-division multiplexing; Nyquist rate; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering","score_opus":0.008824964835665782,"score_gpt":0.21542920250505107,"score_spread":0.2066042376693853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143548765","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.97554183,0.00029037762,0.022256624,0.000059542854,0.000024418796,0.000011039917,0.00004588591,0.00011233899,0.0016579124],"genre_scores_gemma":[0.9957985,0.00007790229,0.0037770588,0.000015535321,0.0000054519337,0.000004377144,0.000044682434,0.0000112238295,0.0002651396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994229,0.00008622878,0.00003072325,0.00006308326,0.00028834405,0.00010869913],"domain_scores_gemma":[0.996855,0.0019701028,0.0003921686,0.00022716532,0.0004872976,0.00006824149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076611026,0.00031629484,0.00047246763,0.00033319776,0.00023049244,0.0004112302,0.00027089208,0.00057187496,0.000806454],"category_scores_gemma":[0.003803869,0.00008903592,0.00016750365,0.00035356786,0.0003597641,0.0003827603,0.0002343918,0.00027005374,0.00018205284],"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.0029105754,0.00028510802,0.03418881,0.0005230998,0.0002467069,0.0016648001,0.00023816271,0.35011142,0.5089729,0.0026972732,0.00062789506,0.09753332],"study_design_scores_gemma":[0.000067357236,0.0021644302,0.02218789,0.00003957746,0.00011238456,0.0012357911,0.00013195895,0.5655505,0.40654758,0.00071351987,0.0011912158,0.000057781413],"about_ca_topic_score_codex":0.0009280806,"about_ca_topic_score_gemma":0.0009313897,"teacher_disagreement_score":0.0009280806,"about_ca_system_score_codex":0.00027249943,"about_ca_system_score_gemma":0.00031624237,"threshold_uncertainty_score":0.0040516257},"labels":[],"label_agreement":null},{"id":"W2143590706","doi":"10.1109/glocom.2006.944","title":"WSN09-5: Anonymous Peer-to-peer Communication Protocol over Mobile Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Internet Traffic Analysis and Secure E-voting","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; Computer network; Mobile ad hoc network; Wireless ad hoc network; Routing protocol; Anonymity; Optimized Link State Routing Protocol; Flooding (psychology); Distributed computing; Computer security; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.007961364483059051,"score_gpt":0.26371763497554884,"score_spread":0.2557562704924898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143590706","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.019536944,0.0011868789,0.9639625,0.00033987826,0.0003794468,0.000571888,0.00028452053,0.0037897166,0.009948184],"genre_scores_gemma":[0.45360315,0.0020592466,0.52798027,0.0003994313,0.00017674624,0.0011300864,0.0015126668,0.00028928815,0.0128491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989134,0.00035635268,0.00011040028,0.00010797305,0.00042036088,0.00009153142],"domain_scores_gemma":[0.9993697,0.00013797797,0.000110084125,0.00012857319,0.00021457096,0.000039113034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042974,0.0005721628,0.00079561997,0.0007844671,0.00071990606,0.0010757758,0.001598162,0.00083259935,0.0015830268],"category_scores_gemma":[0.0018549027,0.000244744,0.00041446977,0.0009030505,0.000583727,0.0015133569,0.0010951526,0.0008482501,0.0008948424],"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.0006459162,0.00040018742,0.0024959731,0.0020371072,0.00043558073,0.0015891531,0.0006483543,0.17239064,0.06785386,0.16042835,0.040107705,0.5509672],"study_design_scores_gemma":[0.00018584906,0.0008119714,0.0015965498,0.00010793718,0.00023582122,0.0025106475,0.00019928467,0.6616689,0.04933952,0.034559287,0.24861442,0.00016981518],"about_ca_topic_score_codex":0.0007737557,"about_ca_topic_score_gemma":0.0013995923,"teacher_disagreement_score":0.001598162,"about_ca_system_score_codex":0.0004859234,"about_ca_system_score_gemma":0.0010601075,"threshold_uncertainty_score":0.0068978667},"labels":[],"label_agreement":null},{"id":"W2144853961","doi":"10.1109/glocom.2006.125","title":"CTH16-3: Optimum Detection of Binary Signals in Rayleigh Fading Channels with Imperfect Channel Estimates","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Additive white Gaussian noise; Antipodal point; Algorithm; Detector; Rayleigh fading; Channel (broadcasting); Mathematics; Binary number; Gaussian noise; Fading; Modulation (music); Statistics; Computer science; White noise; Telecommunications; Physics; Decoding methods; Acoustics","score_opus":0.00805228373916755,"score_gpt":0.22515179017055467,"score_spread":0.21709950643138712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144853961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22069089,0.0012937908,0.7687299,0.0005370403,0.000089283305,0.000102748185,0.00023891035,0.00044404832,0.007873362],"genre_scores_gemma":[0.854044,0.00035059988,0.1434525,0.0001007045,0.000051158913,0.000041353484,0.0001406604,0.000029420624,0.0017897517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852484,0.0004145232,0.00011232819,0.00015490015,0.0005874535,0.00020594415],"domain_scores_gemma":[0.99804544,0.001068036,0.0002739477,0.00017399678,0.0003543301,0.000084167994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017952542,0.0005493281,0.00083019974,0.0007378029,0.00030784664,0.0011813353,0.000587314,0.0009481474,0.0012582169],"category_scores_gemma":[0.005838643,0.0002990208,0.00023824736,0.000611463,0.0010330697,0.0009530049,0.0010495925,0.00039459893,0.00034604437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030153133,0.00015403144,0.010537963,0.0006033152,0.00020563406,0.0009482633,0.00036193096,0.43191677,0.17362173,0.110561214,0.004323857,0.26375],"study_design_scores_gemma":[0.00006873983,0.00028778717,0.0017567918,0.000043034383,0.000026487214,0.00088554283,0.00004108916,0.90415096,0.07043132,0.020231238,0.0020287877,0.000048281792],"about_ca_topic_score_codex":0.000724736,"about_ca_topic_score_gemma":0.0013129164,"teacher_disagreement_score":0.0017952542,"about_ca_system_score_codex":0.000565134,"about_ca_system_score_gemma":0.0012826328,"threshold_uncertainty_score":0.009494305},"labels":[],"label_agreement":null},{"id":"W2145300968","doi":"10.1109/glocom.2006.591","title":"SPC11-1: A Soft-Output Tree/Trellis Multiuser Equalizer for an Iterative FEC-coded DS-CDMA system in Frequency Selective Fading","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Queen's University","funders":"","keywords":"Trellis (graph); Algorithm; Fading; Trellis modulation; Computer science; Rayleigh fading; Space–time trellis code; Convolutional code; Tree (set theory); Code division multiple access; Mathematics; Decoding methods; Telecommunications; Low-density parity-check code; Error floor","score_opus":0.02041663534886946,"score_gpt":0.27285796115227984,"score_spread":0.2524413258034104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145300968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04986423,0.0002614386,0.944153,0.00014955837,0.00006619028,0.000092232025,0.00007920806,0.0009989807,0.004335127],"genre_scores_gemma":[0.41606516,0.00018310387,0.5748777,0.00016470494,0.00006934876,0.00008265379,0.0002670523,0.00007432058,0.008215982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.00006205921,0.00001555737,0.000039347968,0.00014089787,0.00004320243],"domain_scores_gemma":[0.9997037,0.00009122461,0.00003734501,0.00004495256,0.00010594256,0.00001688403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004642046,0.00040349425,0.00030816524,0.0003651346,0.0003414573,0.00051388127,0.00065196847,0.0006079412,0.0021376263],"category_scores_gemma":[0.000895992,0.00016239755,0.00026291225,0.00028279173,0.00029671937,0.00044211332,0.00024003081,0.00059297495,0.00087377353],"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.00094214285,0.00018426278,0.0019113816,0.00023847219,0.00016526302,0.00040490812,0.00018764545,0.14146514,0.266598,0.025505707,0.005591787,0.5568054],"study_design_scores_gemma":[0.00008427451,0.0004935462,0.00118499,0.00002510331,0.000058373742,0.00062837574,0.000022001224,0.8323068,0.1518938,0.0020257947,0.011228995,0.0000479407],"about_ca_topic_score_codex":0.0017419884,"about_ca_topic_score_gemma":0.005348773,"teacher_disagreement_score":0.0021376263,"about_ca_system_score_codex":0.0005426526,"about_ca_system_score_gemma":0.00080637285,"threshold_uncertainty_score":0.0071510673},"labels":[],"label_agreement":null},{"id":"W2145975143","doi":"10.1109/glocom.2006.128","title":"CTH16-6: Adaptive Coding and Modulation for Hybrid ARQ Systems over Partially Observable Nakagami-m Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Link adaptation; Computer science; Fading; Hybrid automatic repeat request; Channel state information; Observable; Algorithm; Automatic repeat request; Adaptive coding; Transmitter; Coding (social sciences); Telecommunications link; Markov process; Channel (broadcasting); Decoding methods; Computer network; Wireless; Mathematics; Telecommunications; Statistics","score_opus":0.014154824316424909,"score_gpt":0.20651242688273236,"score_spread":0.19235760256630746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145975143","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.0769868,0.000550124,0.9178157,0.00029713183,0.00007259632,0.000057282257,0.00006739774,0.00013632077,0.004016664],"genre_scores_gemma":[0.95811933,0.000316143,0.039177332,0.00005562339,0.000051965308,0.00006961052,0.00004893323,0.00001895977,0.0021421367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996848,0.00012642296,0.000009632333,0.00003892603,0.00007755072,0.00006266137],"domain_scores_gemma":[0.9990219,0.00065423816,0.00012015295,0.000052946136,0.00011263529,0.000038137707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009323353,0.00054430455,0.0005937712,0.00021441681,0.00026462862,0.0007236904,0.000565364,0.00060259557,0.0012177739],"category_scores_gemma":[0.0014399142,0.00017798138,0.0003530345,0.00040251957,0.0007863119,0.0005686832,0.000607686,0.00060794497,0.000108155735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002992636,0.000014943122,0.00022857482,0.000029637282,0.000016444128,0.00004502077,0.000020840464,0.981991,0.0013777143,0.009253172,0.00031752544,0.006675217],"study_design_scores_gemma":[0.00000447187,0.000019386165,0.00004986037,0.0000012173175,0.000002239028,0.0000063752163,0.0000031200764,0.9983852,0.00018820535,0.0012430779,0.00009515016,0.0000017409402],"about_ca_topic_score_codex":0.0055926084,"about_ca_topic_score_gemma":0.0030507182,"teacher_disagreement_score":0.0055926084,"about_ca_system_score_codex":0.0006186648,"about_ca_system_score_gemma":0.00088590576,"threshold_uncertainty_score":0.011120141},"labels":[],"label_agreement":null},{"id":"W2146989178","doi":"10.1109/glocom.2006.925","title":"WSN01-1: Frame Aggregation and Optimal Frame Size Adaptation for IEEE 802.11n WLANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Frame (networking); Computer network; Protocol data unit; Throughput; Network packet; Channel (broadcasting); Network allocation vector; Local area network; Physical layer; Protocol (science); IEEE 802.11; Multiple Access with Collision Avoidance for Wireless; Wireless; Telecommunications","score_opus":0.012616918525001648,"score_gpt":0.24113368319086875,"score_spread":0.2285167646658671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146989178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042457514,0.0010913025,0.95241266,0.0001503296,0.000113241,0.00012206892,0.000056212542,0.0009579089,0.002638816],"genre_scores_gemma":[0.61062235,0.0014111466,0.38392875,0.00007416443,0.00014031131,0.00019184868,0.00029437183,0.00012918837,0.003207835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00012906975,0.000029879664,0.00008292082,0.00013669455,0.000047924666],"domain_scores_gemma":[0.999629,0.00013752385,0.000060085218,0.000046001893,0.00010716641,0.000020271307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015461375,0.0007178536,0.00062952243,0.00054722547,0.00030738564,0.00045672385,0.0009181796,0.00047314772,0.0006993845],"category_scores_gemma":[0.0022011644,0.00028160686,0.00037334548,0.0007174908,0.00029901738,0.00077892246,0.00045031792,0.00045783457,0.00025982352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039332273,0.00027944832,0.0027121599,0.00020249569,0.00008553879,0.00018324082,0.00018576892,0.51260304,0.034075215,0.016451512,0.005861291,0.426967],"study_design_scores_gemma":[0.00001625141,0.00013243634,0.0005285307,0.000009194341,0.000013037818,0.00007676546,0.000012740802,0.9924333,0.003791554,0.0008785375,0.0020962388,0.000011427918],"about_ca_topic_score_codex":0.0036739453,"about_ca_topic_score_gemma":0.0044532837,"teacher_disagreement_score":0.0036739453,"about_ca_system_score_codex":0.0007272252,"about_ca_system_score_gemma":0.00069378095,"threshold_uncertainty_score":0.008176863},"labels":[],"label_agreement":null},{"id":"W2149284565","doi":"10.1109/glocom.2006.637","title":"WLC04-5: Bandwidth Allocation in 4G Heterogeneous Wireless Access Networks: A Noncooperative Game Theoretical Approach","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Manitoba","funders":"","keywords":"Computer science; Computer network; Quality of service; Bandwidth allocation; Oligopoly; Wireless network; Dynamic bandwidth allocation; Nash equilibrium; Bandwidth (computing); Game theory; Wireless; Cournot competition; Mathematical optimization; Telecommunications; Microeconomics; Economics","score_opus":0.010846706878348442,"score_gpt":0.25745472051387647,"score_spread":0.24660801363552803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149284565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011071883,0.00025179875,0.97153676,0.0010261805,0.0000752734,0.00016648135,0.00007253069,0.00006379798,0.015735298],"genre_scores_gemma":[0.7098863,0.00095185026,0.27090988,0.0007484065,0.00021078957,0.0007610648,0.000137455,0.000078101184,0.0163161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.0007475164,0.000027001592,0.0000947945,0.00018968007,0.00011462186],"domain_scores_gemma":[0.9987558,0.0008453265,0.00008640262,0.000047202357,0.00019240854,0.000072790426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019374922,0.0008078272,0.00088336354,0.0006093485,0.0006945719,0.0018297064,0.0015430137,0.0019066454,0.0032561217],"category_scores_gemma":[0.0026537462,0.00032481033,0.00076055684,0.00080700207,0.0018250037,0.0017210477,0.0009337781,0.0013927361,0.00034975656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057438294,0.00008153062,0.00022960204,0.000093601986,0.000034160283,0.00011946785,0.000095362135,0.663549,0.0010686028,0.31546286,0.0037368005,0.015471595],"study_design_scores_gemma":[0.000017237375,0.000022532515,0.000047183472,0.000010377602,0.0000075545045,0.000020206222,0.000020241441,0.948745,0.00031003714,0.048945703,0.0018460405,0.000007796139],"about_ca_topic_score_codex":0.006799676,"about_ca_topic_score_gemma":0.0042892564,"teacher_disagreement_score":0.006799676,"about_ca_system_score_codex":0.0025717365,"about_ca_system_score_gemma":0.0027002282,"threshold_uncertainty_score":0.018659294},"labels":[],"label_agreement":null},{"id":"W2152003941","doi":"10.1109/glocom.2006.655","title":"WLC07-5: The Effects of Mobility on the Bit Error Rate Performance of Ad Hoc Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Rician fading; Computer science; Bit error rate; Node (physics); Computer network; Waypoint; Mobility model; Mobile ad hoc network; Transmission (telecommunications); Fading; Wireless; Real-time computing; Channel (broadcasting); Telecommunications; Network packet; Physics","score_opus":0.006192139619971153,"score_gpt":0.2025820259056817,"score_spread":0.19638988628571055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152003941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18919379,0.019560104,0.74433166,0.0021662356,0.0010997008,0.0002402342,0.00057968684,0.0031103783,0.039718196],"genre_scores_gemma":[0.9261794,0.007529465,0.052952774,0.00031546675,0.00038376232,0.00019177505,0.0006561922,0.00047290424,0.011318264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972486,0.0009177219,0.000096600226,0.00013846056,0.0013513806,0.0002472916],"domain_scores_gemma":[0.9941554,0.0028632325,0.00044415452,0.0005508999,0.0018775872,0.00010859861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337321,0.0011820951,0.0008666517,0.0014520619,0.0006098755,0.001558142,0.0009969999,0.0013160382,0.002041586],"category_scores_gemma":[0.010546437,0.00035031902,0.00041473896,0.0017488712,0.00097340136,0.0017126952,0.0007614412,0.00094242336,0.0012938947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066210655,0.0002473563,0.006021361,0.0006237754,0.00025991572,0.0010631456,0.00020359816,0.66583663,0.0411531,0.058987625,0.02325551,0.20168586],"study_design_scores_gemma":[0.000022867938,0.0004196476,0.0016961118,0.00007454295,0.000058854283,0.0006768116,0.000040663104,0.9563131,0.023282837,0.0074786344,0.009888064,0.000047903253],"about_ca_topic_score_codex":0.002466137,"about_ca_topic_score_gemma":0.002437258,"teacher_disagreement_score":0.002466137,"about_ca_system_score_codex":0.0013128802,"about_ca_system_score_gemma":0.0008326767,"threshold_uncertainty_score":0.012361109},"labels":[],"label_agreement":null},{"id":"W2152408207","doi":"10.1109/glocom.2006.570","title":"SPC07-3: An Iterative QR-SIC Receiver for Concatenated Space Frequency Coding Schemes in Severe Multipath Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multipath propagation; Computer science; Single antenna interference cancellation; Orthogonal frequency-division multiplexing; Algorithm; Fading; MIMO; Turbo code; Diversity scheme; QR decomposition; Electronic engineering; MIMO-OFDM; Channel (broadcasting); Decoding methods; Telecommunications; Engineering; Physics","score_opus":0.016520590186403783,"score_gpt":0.2632228287976637,"score_spread":0.2467022386112599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152408207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013949781,0.00023053946,0.9836098,0.000059919286,0.000026200725,0.00004706457,0.000025427813,0.0002709433,0.0017803763],"genre_scores_gemma":[0.3201116,0.00035722047,0.6763547,0.00010048651,0.00006911918,0.00006393577,0.00011305234,0.00005110614,0.00277881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991442,0.00025548562,0.0000383935,0.00006796994,0.0004243441,0.00006964083],"domain_scores_gemma":[0.9987418,0.0004012444,0.00016234878,0.00017084817,0.00047080807,0.000053004638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135495,0.00067002507,0.00066602946,0.00031955435,0.00036182627,0.00071822555,0.0006700944,0.0008433087,0.0012228657],"category_scores_gemma":[0.0022857548,0.00028186632,0.00048692766,0.00047750893,0.00054669945,0.0005686379,0.000613628,0.00082004693,0.00092750473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000485253,0.00013703268,0.0026207997,0.00031953768,0.0002043008,0.00048460835,0.00028593172,0.6250154,0.13630429,0.0393682,0.003572707,0.19120206],"study_design_scores_gemma":[0.000018035647,0.0002883005,0.00024307733,0.000013683633,0.000026878315,0.00037423408,0.00001188476,0.96547693,0.02990917,0.0010636174,0.002547539,0.000026646954],"about_ca_topic_score_codex":0.0009179775,"about_ca_topic_score_gemma":0.0017090784,"teacher_disagreement_score":0.0012228657,"about_ca_system_score_codex":0.0003937621,"about_ca_system_score_gemma":0.0010647319,"threshold_uncertainty_score":0.005889058},"labels":[],"label_agreement":null},{"id":"W2153578293","doi":"10.1109/glocom.2006.821","title":"WLC35-5: User-Aided Adaptive TDMA for Real-Time Services in an OFDM Based Cellular System","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Time division multiple access; Computer science; Orthogonal frequency-division multiplexing; Computer network; Channel (broadcasting); Channel allocation schemes; Spectral efficiency; Cellular network; Resource allocation; Real-time computing; Scheme (mathematics); Link adaptation; Distributed computing; Fading; Wireless; Telecommunications; Mathematics","score_opus":0.004712355726665208,"score_gpt":0.18881867967896956,"score_spread":0.18410632395230436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153578293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06496085,0.00035395013,0.9289894,0.00012755112,0.00008125352,0.000081489976,0.000041150666,0.0005318621,0.0048324796],"genre_scores_gemma":[0.78251684,0.0001888753,0.21307932,0.0000860509,0.00003866261,0.00009604635,0.00008189052,0.000020938265,0.003891371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980205,0.000048427133,0.00000960353,0.000023076527,0.000079686375,0.000037117134],"domain_scores_gemma":[0.9998173,0.00004854199,0.000024562025,0.000020668964,0.000075434255,0.000013493836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030980105,0.00026602173,0.00028557918,0.00035588484,0.00027210012,0.00047488505,0.0005231675,0.00041236292,0.0013252243],"category_scores_gemma":[0.00071981037,0.00007257462,0.00012654829,0.00031464038,0.0002912287,0.00030854065,0.0002623091,0.00023162743,0.00030700283],"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.00038793928,0.00014007177,0.0024164938,0.00013744574,0.000054647116,0.0003172346,0.00011282282,0.4364996,0.049455132,0.028347526,0.005227545,0.47690353],"study_design_scores_gemma":[0.000025868887,0.00010138979,0.00039503165,0.0000046021223,0.000011035212,0.00012823474,0.000011859338,0.9827413,0.011056777,0.0011740897,0.0043385187,0.000011341605],"about_ca_topic_score_codex":0.0038721382,"about_ca_topic_score_gemma":0.005768202,"teacher_disagreement_score":0.0038721382,"about_ca_system_score_codex":0.00045756708,"about_ca_system_score_gemma":0.00080340536,"threshold_uncertainty_score":0.0076991916},"labels":[],"label_agreement":null},{"id":"W2155705529","doi":"10.1109/glocom.2006.702","title":"WLC15-5: QoS Provisioning in the Absence of ARQ in Cellular Fixed Relay Networks through Inter-Cell Coordination","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Automatic repeat request; Network packet; Quality of service; Overhead (engineering); Throughput; Scheduling (production processes); Selective Repeat ARQ; Relay; Hybrid automatic repeat request; Wireless; Telecommunications link; Engineering; Telecommunications","score_opus":0.01656261650233108,"score_gpt":0.24803011527130744,"score_spread":0.23146749876897638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155705529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2131162,0.00085563405,0.77767533,0.000334897,0.00012679596,0.00016146693,0.00007090186,0.0009949829,0.0066638566],"genre_scores_gemma":[0.932935,0.00012086528,0.06575951,0.00006690429,0.000030510319,0.000044348748,0.000041568648,0.000014454875,0.0009869245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00013340091,0.000027374244,0.00007816781,0.00016354618,0.00010164162],"domain_scores_gemma":[0.9994442,0.00010041233,0.000111589216,0.0001231677,0.00015723355,0.00006333676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223746,0.00043898425,0.0004911066,0.00050639285,0.0006100482,0.00084533443,0.0016697373,0.00050261524,0.00074648694],"category_scores_gemma":[0.00087887404,0.000116573785,0.00028926015,0.00039697916,0.00073416275,0.0005960248,0.0006749076,0.0004260373,0.00019944937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076552154,0.00031455918,0.0043694857,0.00027763654,0.00019593482,0.0012802773,0.00044423455,0.4694969,0.12571242,0.05256185,0.0050528888,0.33952832],"study_design_scores_gemma":[0.000081049984,0.0006073803,0.001021817,0.00001398378,0.000066898356,0.00038593175,0.000053444724,0.95863956,0.02978145,0.0038521695,0.0054568104,0.000039517487],"about_ca_topic_score_codex":0.003782585,"about_ca_topic_score_gemma":0.0045522074,"teacher_disagreement_score":0.003782585,"about_ca_system_score_codex":0.0007768991,"about_ca_system_score_gemma":0.0009872438,"threshold_uncertainty_score":0.007521093},"labels":[],"label_agreement":null},{"id":"W2158099903","doi":"10.1109/glocom.2006.706","title":"WLC16-3: Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Space–time block code; Block code; Algorithm; QAM; Upper and lower bounds; Computer science; Quadrature amplitude modulation; List decoding; Mathematics; Discrete mathematics; Theoretical computer science; Bit error rate; Concatenated error correction code","score_opus":0.032836028145906034,"score_gpt":0.2674403080796431,"score_spread":0.23460427993373706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158099903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043260343,0.00067953137,0.94802815,0.00019704143,0.000036778758,0.00008330219,0.00021281457,0.0002888507,0.007213207],"genre_scores_gemma":[0.5796594,0.0009322256,0.41528815,0.00015999471,0.000102285456,0.00033852187,0.0004974267,0.00016427571,0.0028577866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975424,0.0008854307,0.00012933751,0.00022353229,0.0009697363,0.0002494982],"domain_scores_gemma":[0.99519724,0.002714891,0.00050645025,0.00056461926,0.00092911616,0.000087584274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387993,0.0014357488,0.00092906755,0.0011802291,0.00039020955,0.0013869645,0.0006522009,0.0008728415,0.0037051116],"category_scores_gemma":[0.0113749895,0.00042405937,0.0004950874,0.001369064,0.0010866697,0.0013186057,0.00093770627,0.0007216914,0.0010182962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006322504,0.000094335344,0.00111324,0.0002618197,0.000093972936,0.00013841903,0.00015436044,0.75131637,0.032478847,0.104933605,0.0020918248,0.106690995],"study_design_scores_gemma":[0.000059383103,0.00019545015,0.00035774277,0.000034242574,0.000022519322,0.00014306736,0.000018999466,0.96158224,0.013676387,0.021930715,0.0019500729,0.000029133138],"about_ca_topic_score_codex":0.0012859005,"about_ca_topic_score_gemma":0.0014681624,"teacher_disagreement_score":0.0037051116,"about_ca_system_score_codex":0.0011235885,"about_ca_system_score_gemma":0.0022319325,"threshold_uncertainty_score":0.012629032},"labels":[],"label_agreement":null},{"id":"W2161515511","doi":"10.1109/glocom.2006.982","title":"WSN16-1: A Weighted Clustering Algorithm Using Local Cluster-heads Election for QoS in MANETs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Quality of service; Network packet; Routing protocol; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Network topology; Topology (electrical circuits); Algorithm; Wireless; Mathematics; Artificial intelligence","score_opus":0.009823099420125637,"score_gpt":0.24271082640668218,"score_spread":0.23288772698655655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161515511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011751042,0.0004668882,0.9847514,0.00013029383,0.00013698816,0.00012761664,0.000047145804,0.0011666323,0.0014219249],"genre_scores_gemma":[0.2244573,0.0006334531,0.7689806,0.00015895504,0.000113275615,0.00032545888,0.0005075707,0.0002719731,0.0045514638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.0001656339,0.00004158339,0.00012836613,0.00026565834,0.000050032108],"domain_scores_gemma":[0.99945945,0.00012280107,0.00005538441,0.00008577116,0.00023462836,0.000041955365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010211047,0.00081992,0.000866101,0.0011921052,0.0007149442,0.00057137175,0.0022208295,0.0007858392,0.0011987397],"category_scores_gemma":[0.0016606632,0.00032276651,0.0004327313,0.0015005749,0.00044103636,0.0015230195,0.0010372926,0.00066083437,0.000742326],"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.00033314567,0.00019096896,0.0023728628,0.00024701317,0.00022959609,0.00013590294,0.00020621826,0.3263294,0.025450973,0.016920736,0.009238545,0.6183446],"study_design_scores_gemma":[0.00006990421,0.00016748498,0.0006560692,0.000014190542,0.00004478855,0.00015204707,0.000057839326,0.97105545,0.008622822,0.0053642266,0.013748943,0.000046178047],"about_ca_topic_score_codex":0.0026040361,"about_ca_topic_score_gemma":0.0036846814,"teacher_disagreement_score":0.0026040361,"about_ca_system_score_codex":0.0005711581,"about_ca_system_score_gemma":0.0008570077,"threshold_uncertainty_score":0.005400181},"labels":[],"label_agreement":null},{"id":"W2163614426","doi":"10.1109/glocom.2006.840","title":"WLC38-6: Minimax Linear Precoding for MISO Broadcast Channels with Bounded Uncertainty","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Precoding; Telecommunications link; Base station; Computer science; Mathematical optimization; Channel (broadcasting); Transmission (telecommunications); Channel state information; Bounded function; Zero-forcing precoding; Transmitter power output; Optimization problem; Control theory (sociology); MIMO; Mathematics; Wireless; Telecommunications; Transmitter","score_opus":0.009438924203018647,"score_gpt":0.21786655028168822,"score_spread":0.20842762607866958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163614426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020986,0.00034214917,0.97439,0.00043267076,0.000033439817,0.000026204245,0.00009312049,0.00011536863,0.003581083],"genre_scores_gemma":[0.8429402,0.00063479174,0.15072547,0.00022415679,0.00012442566,0.00017225422,0.00018096835,0.000069158996,0.004928678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944717,0.00022944079,0.000017952503,0.00006606533,0.00017623066,0.000063095555],"domain_scores_gemma":[0.9990578,0.000644239,0.000099346806,0.0000639977,0.000117292366,0.000017354627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009928392,0.000607649,0.0007982064,0.00027402272,0.00027356853,0.0008509503,0.00045189477,0.0007298065,0.0014119254],"category_scores_gemma":[0.0035224943,0.00022035326,0.0002793382,0.00051875896,0.0008032095,0.000732532,0.00053341035,0.0006860619,0.00027153752],"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.00004446482,0.000012543697,0.00014672881,0.000048812333,0.00001599522,0.000032614505,0.000026954442,0.96844596,0.0011936969,0.01879814,0.00069835235,0.010535794],"study_design_scores_gemma":[0.000007741715,0.000021388305,0.000047422986,0.0000056266235,0.0000025990496,0.000007998067,0.000004796403,0.9937581,0.00067323865,0.00518022,0.00028754954,0.0000034287177],"about_ca_topic_score_codex":0.0026785033,"about_ca_topic_score_gemma":0.0022354522,"teacher_disagreement_score":0.0026785033,"about_ca_system_score_codex":0.0006487951,"about_ca_system_score_gemma":0.0009774114,"threshold_uncertainty_score":0.005325854},"labels":[],"label_agreement":null},{"id":"W2164848417","doi":"10.1109/glocom.2006.877","title":"WLC45-1: Turbo Coded Type-II H-ARQ Scheme with Incremental Redundancy Using Sub-Block Recovery","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Selective Repeat ARQ; Computer science; Turbo code; Hybrid automatic repeat request; Algorithm; Turbo; Convolutional code; Automatic repeat request; Retransmission; Error detection and correction; Decoding methods; Computer network; Engineering; Telecommunications link","score_opus":0.010488746395528582,"score_gpt":0.22535041489163574,"score_spread":0.21486166849610716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164848417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07813291,0.0010496189,0.9097486,0.0003724189,0.0004497251,0.0003644766,0.00025736203,0.0023484502,0.0072764303],"genre_scores_gemma":[0.73975337,0.00037861007,0.25168106,0.00029295892,0.0001895013,0.00017151212,0.00030784743,0.000062524035,0.0071625942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.00012817253,0.00003610156,0.00005675647,0.00019365143,0.00009708707],"domain_scores_gemma":[0.998833,0.00014637642,0.00014663435,0.00030594057,0.00048917095,0.00007900656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068220956,0.0004715466,0.0005814351,0.0006184493,0.00046151874,0.0006430267,0.0011934179,0.000688825,0.0015867535],"category_scores_gemma":[0.0013004271,0.00016297447,0.00032244602,0.00052567676,0.0005670605,0.0008161581,0.0005858584,0.0005885271,0.0008293146],"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.0015699926,0.00021414105,0.002765209,0.00059257454,0.000222826,0.001203953,0.00045082113,0.0774747,0.25655204,0.05566941,0.014456621,0.58882767],"study_design_scores_gemma":[0.0003138517,0.0012666651,0.0023132816,0.000055845252,0.0001491963,0.002148306,0.000087858,0.844179,0.115174755,0.007224501,0.026868895,0.00021785666],"about_ca_topic_score_codex":0.0015854555,"about_ca_topic_score_gemma":0.0018241361,"teacher_disagreement_score":0.0015867535,"about_ca_system_score_codex":0.0004416266,"about_ca_system_score_gemma":0.0009096339,"threshold_uncertainty_score":0.0053082705},"labels":[],"label_agreement":null},{"id":"W2165072660","doi":"10.1109/glocom.2006.985","title":"WSN16-4: Logical Topology Design and Interface Assignment for Multi-Channel Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Logical topology; Router; Wireless mesh network; Topology (electrical circuits); Network topology; Interface (matter); Distributed computing; Mesh networking; Goodput; Wireless network; Switched mesh; Channel (broadcasting); Wireless; Throughput; Engineering; Telecommunications; Parallel computing","score_opus":0.032760701758184,"score_gpt":0.2707320205910452,"score_spread":0.23797131883286118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165072660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02111707,0.00017052724,0.97585016,0.00011714835,0.000038283375,0.00010670436,0.00005162583,0.00043717862,0.0021112985],"genre_scores_gemma":[0.27120817,0.00018338465,0.72617155,0.00005017777,0.000036673086,0.0001640631,0.00018489418,0.000093872346,0.0019071833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.00012685971,0.000020122683,0.000034931003,0.00009137668,0.000029285759],"domain_scores_gemma":[0.99965525,0.0000955819,0.00006233878,0.000058096884,0.000105533974,0.000023192091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488014,0.0003495872,0.0003155422,0.0005392429,0.00031774107,0.00052381714,0.0009801044,0.0003189654,0.0018362044],"category_scores_gemma":[0.0015150375,0.00021419204,0.00021534656,0.00049522734,0.00029745125,0.00073298864,0.0005438557,0.0003130641,0.00023227255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018690043,0.00009426551,0.00221009,0.00025837385,0.0000756486,0.000083188235,0.00008676546,0.6642131,0.023773892,0.016292546,0.004730708,0.28799447],"study_design_scores_gemma":[0.000029897188,0.00005549065,0.00027229838,0.000005763364,0.000009465307,0.000038848193,0.000012731813,0.98792136,0.0056010927,0.0026119177,0.0034355663,0.0000057039597],"about_ca_topic_score_codex":0.0013712033,"about_ca_topic_score_gemma":0.0032709795,"teacher_disagreement_score":0.0018362044,"about_ca_system_score_codex":0.0005922791,"about_ca_system_score_gemma":0.0007182676,"threshold_uncertainty_score":0.0061427355},"labels":[],"label_agreement":null},{"id":"W2166045751","doi":"10.1109/glocom.2006.115","title":"CTH14-5: Probability Density Functions of Logarithmic Likelihood Ratios in Phase Shift Keying BICM","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Phase-shift keying; Algorithm; Computer science; Demodulation; Keying; Binary number; Channel (broadcasting); Modulation (music); Probabilistic logic; Encoder; Bit error rate; Transmission (telecommunications); Probability density function; Logarithm; Decoding methods; Amplitude and phase-shift keying; Electronic engineering; Mathematics; Telecommunications; Statistics; Arithmetic; Engineering; Physics; Artificial intelligence","score_opus":0.011303235933100649,"score_gpt":0.24638204009543999,"score_spread":0.23507880416233934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166045751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059887287,0.0015604069,0.9820837,0.00042913115,0.00012774796,0.000062927225,0.00013395432,0.00037268808,0.0092407735],"genre_scores_gemma":[0.65262085,0.004263604,0.32044744,0.0009909074,0.0007012849,0.0005822067,0.0006141153,0.0004815137,0.019298086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799097,0.0010417129,0.00006015197,0.00014101547,0.00058599154,0.00018008894],"domain_scores_gemma":[0.9934216,0.0048003118,0.00039450452,0.0004908873,0.00078694883,0.000105840765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042925896,0.0010422633,0.00095175864,0.0013958619,0.00068090955,0.0020272483,0.0019127651,0.0018822978,0.0046828934],"category_scores_gemma":[0.02170445,0.00062039215,0.0008726706,0.0020191916,0.002024098,0.0024687003,0.0013364945,0.0023433575,0.0016627129],"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.00012220393,0.000031629086,0.00085966487,0.00016269222,0.00003136673,0.00028755126,0.00016923429,0.3414675,0.0013754434,0.6141871,0.0056353505,0.035670232],"study_design_scores_gemma":[0.0000142653025,0.000029905961,0.00031127798,0.000050488867,0.00000978509,0.00026629612,0.000022597445,0.8720235,0.0009874895,0.12205115,0.0041957754,0.000037457896],"about_ca_topic_score_codex":0.0031284988,"about_ca_topic_score_gemma":0.0016912646,"teacher_disagreement_score":0.0046828934,"about_ca_system_score_codex":0.0021912188,"about_ca_system_score_gemma":0.0013189128,"threshold_uncertainty_score":0.02270168},"labels":[],"label_agreement":null},{"id":"W2170206121","doi":"10.1109/glocom.2006.951","title":"WSN10-6: An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Computer network; Traffic flow (computer networking); Wireless; Network delay; Energy (signal processing); Linear programming; Real-time computing; Mathematical optimization; Network packet; Algorithm; Engineering; Telecommunications; Mathematics","score_opus":0.008983945914421487,"score_gpt":0.21093189603225743,"score_spread":0.20194795011783595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170206121","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.8976859,0.0021869233,0.09064057,0.00059383473,0.000112260605,0.00014055666,0.00038646834,0.00013611231,0.008117308],"genre_scores_gemma":[0.98056775,0.0015609474,0.015742889,0.000062565334,0.000034631365,0.00007640178,0.00027504214,0.000051129344,0.0016287139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939513,0.00025516356,0.000028307439,0.0000675759,0.0001737905,0.00007999956],"domain_scores_gemma":[0.99773264,0.0016067243,0.0001816828,0.00013766332,0.00027228365,0.00006901158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012627136,0.0010380736,0.0005258181,0.00079868466,0.00036452748,0.00044044649,0.00075237924,0.00066609925,0.0010203948],"category_scores_gemma":[0.0030512372,0.0002323018,0.0005784227,0.0011788078,0.00042550478,0.0013804027,0.00037990464,0.0005442626,0.000111420166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022295787,0.00031085272,0.003652499,0.00030880157,0.00011644367,0.00022989759,0.00005292755,0.9549748,0.015176844,0.006742772,0.00097294693,0.017238358],"study_design_scores_gemma":[0.000014670992,0.0002932028,0.001438909,0.00001270228,0.00002369302,0.00014791948,0.000053768254,0.98954505,0.0058819256,0.0018315165,0.0007468629,0.000009670107],"about_ca_topic_score_codex":0.0020373662,"about_ca_topic_score_gemma":0.0022045034,"teacher_disagreement_score":0.0020373662,"about_ca_system_score_codex":0.0009560575,"about_ca_system_score_gemma":0.00041887193,"threshold_uncertainty_score":0.006936729},"labels":[],"label_agreement":null}]}