{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":100,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":100,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"364f5a8b1d41","filters":{"venue":"Globecom"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yuxia Lin","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01261691852500165,"gpt":0.2411336831908688,"spread":0.2285167646658671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546138,0.0007178536,0.0006295224,0.0005472255,0.0003073856,0.0004567239,0.0009181796,0.0004731477,0.0006993845],"category_scores_gemma":[0.002201164,0.0002816069,0.0003733455,0.0007174908,0.0002990174,0.0007789225,0.0004503179,0.0004578346,0.0002598235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007272252,"about_ca_system_score_gemma":0.000693781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003673945,"about_ca_topic_score_gemma":0.004453284,"domain_scores_codex":[0.9995735,0.0001290698,0.00002987966,0.00008292082,0.0001366946,0.00004792467],"domain_scores_gemma":[0.999629,0.0001375238,0.00006008522,0.00004600189,0.0001071664,0.00002027131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003933227,0.0002794483,0.00271216,0.0002024957,0.00008553879,0.0001832408,0.0001857689,0.512603,0.03407522,0.01645151,0.005861291,0.426967],"study_design_scores_gemma":[0.00001625141,0.0001324363,0.0005285307,0.000009194341,0.00001303782,0.00007676546,0.0000127408,0.9924333,0.003791554,0.0008785375,0.002096239,0.00001142792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04245751,0.001091302,0.9524127,0.0001503296,0.000113241,0.0001220689,0.00005621254,0.0009579089,0.002638816],"genre_scores_gemma":[0.6106223,0.001411147,0.3839287,0.00007416443,0.0001403113,0.0001918487,0.0002943718,0.0001291884,0.003207835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003673945,"threshold_uncertainty_score":0.008176863,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeffrey Erman","is_ca":true},{"name":"Anirban Mahanti","is_ca":true},{"name":"Martin Arlitt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01276875985558615,"gpt":0.233310171501306,"spread":0.2205414116457198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618576,0.0006734828,0.0008822877,0.002516732,0.0005655597,0.0007880293,0.001166485,0.001134106,0.002716841],"category_scores_gemma":[0.004380798,0.000186271,0.0004637248,0.001485781,0.0003789306,0.001151907,0.0005738564,0.0006558782,0.001962945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005085386,"about_ca_system_score_gemma":0.0007057489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003490969,"about_ca_topic_score_gemma":0.004066697,"domain_scores_codex":[0.9982346,0.0006833415,0.00007650029,0.00022089,0.0006707011,0.0001138676],"domain_scores_gemma":[0.9971246,0.0009674171,0.0002480138,0.0005924849,0.0009736625,0.00009389852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00123931,0.002998488,0.0369844,0.0004616975,0.0003852502,0.0003933535,0.0001504186,0.1509217,0.05457013,0.006298082,0.03234458,0.7132526],"study_design_scores_gemma":[0.00009387833,0.0007267508,0.01039213,0.00001216233,0.0000302386,0.0003198577,0.00004928868,0.9366256,0.04354984,0.002156361,0.005989497,0.0000544955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4305718,0.000370176,0.5147109,0.0007980551,0.0003905258,0.001128035,0.002490002,0.02896046,0.0205801],"genre_scores_gemma":[0.5766671,0.0001556214,0.4084141,0.0002516478,0.0001181713,0.0004011692,0.005438818,0.0003667795,0.008186627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003490969,"threshold_uncertainty_score":0.009088755,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jun Yuan","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00556253653233551,"gpt":0.2082042043768037,"spread":0.2026416678444682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946015,0.001221335,0.0008194033,0.0004667973,0.0004050806,0.001160759,0.001334658,0.00100174,0.001257305],"category_scores_gemma":[0.001546162,0.000431776,0.0009110854,0.0006021375,0.00129427,0.001327086,0.001507312,0.001446193,0.0001892821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115609,"about_ca_system_score_gemma":0.001356157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001505508,"about_ca_topic_score_gemma":0.001775312,"domain_scores_codex":[0.9989536,0.0005946124,0.00003201201,0.0001158097,0.0002349757,0.00006893925],"domain_scores_gemma":[0.9994785,0.0003092965,0.00005336491,0.00003972315,0.00008392021,0.00003521203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002158541,0.00004142728,0.0001338785,0.00006956043,0.00004405591,0.00004788407,0.00003901451,0.8883631,0.001655904,0.09796499,0.0007979103,0.0108207],"study_design_scores_gemma":[0.000008329961,0.00002535316,0.00004171579,0.000006031353,0.00000766216,0.00001773209,0.000009862993,0.978493,0.0003146689,0.01981699,0.001253688,0.00000489112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003203763,0.0001870698,0.9936551,0.000206377,0.00003074379,0.000032149,0.00001487439,0.00002699261,0.002642927],"genre_scores_gemma":[0.5424571,0.001549643,0.447094,0.0003638022,0.0001880609,0.0004238917,0.0001034276,0.0001179895,0.007702097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001946015,"threshold_uncertainty_score":0.01029164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01084670687834844,"gpt":0.2574547205138765,"spread":0.246608013635528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001937492,0.0008078272,0.0008833635,0.0006093485,0.0006945719,0.001829706,0.001543014,0.001906645,0.003256122],"category_scores_gemma":[0.002653746,0.0003248103,0.0007605568,0.0008070021,0.001825004,0.001721048,0.0009337781,0.001392736,0.0003497566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002571736,"about_ca_system_score_gemma":0.002700228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006799676,"about_ca_topic_score_gemma":0.004289256,"domain_scores_codex":[0.9988263,0.0007475164,0.00002700159,0.0000947945,0.0001896801,0.0001146219],"domain_scores_gemma":[0.9987558,0.0008453265,0.00008640262,0.00004720236,0.0001924085,0.00007279043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005743829,0.00008153062,0.000229602,0.00009360199,0.00003416028,0.0001194678,0.00009536213,0.663549,0.001068603,0.3154629,0.003736801,0.0154716],"study_design_scores_gemma":[0.00001723737,0.00002253251,0.00004718347,0.0000103776,0.000007554504,0.00002020622,0.00002024144,0.948745,0.0003100371,0.0489457,0.00184604,0.000007796139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01107188,0.0002517987,0.9715368,0.00102618,0.0000752734,0.0001664813,0.00007253069,0.00006379798,0.0157353],"genre_scores_gemma":[0.7098863,0.0009518503,0.2709099,0.0007484065,0.0002107896,0.0007610648,0.000137455,0.00007810118,0.0163161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006799676,"threshold_uncertainty_score":0.01865929,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"A. Hamed Mohsenian Rad","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.032760701758184,"gpt":0.2707320205910452,"spread":0.2379713188328612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048801,0.0003495872,0.0003155422,0.0005392429,0.0003177411,0.0005238171,0.0009801044,0.0003189654,0.001836204],"category_scores_gemma":[0.001515037,0.000214192,0.0002153466,0.0004952273,0.0002974512,0.0007329886,0.0005438557,0.0003130641,0.0002322725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005922791,"about_ca_system_score_gemma":0.0007182676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001371203,"about_ca_topic_score_gemma":0.00327098,"domain_scores_codex":[0.9996974,0.0001268597,0.00002012268,0.000034931,0.00009137668,0.00002928576],"domain_scores_gemma":[0.9996552,0.0000955819,0.00006233878,0.00005809688,0.000105534,0.00002319209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001869004,0.00009426551,0.00221009,0.0002583739,0.0000756486,0.00008318824,0.00008676546,0.6642131,0.02377389,0.01629255,0.004730708,0.2879945],"study_design_scores_gemma":[0.00002989719,0.00005549065,0.0002722984,0.000005763364,0.000009465307,0.00003884819,0.00001273181,0.9879214,0.005601093,0.002611918,0.003435566,0.00000570396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02111707,0.0001705272,0.9758502,0.0001171484,0.00003828338,0.0001067044,0.00005162583,0.0004371786,0.002111298],"genre_scores_gemma":[0.2712082,0.0001833846,0.7261716,0.00005017777,0.00003667309,0.0001640631,0.0001848942,0.00009387235,0.001907183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001836204,"threshold_uncertainty_score":0.006142735,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Quanhong Wang","is_ca":true},{"name":"Kenan Xu","is_ca":true},{"name":"Glen Takahara","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005216369165350171,"gpt":0.2020008798834271,"spread":0.1967845107180769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066254,0.0009574709,0.0005430834,0.001053334,0.0006036176,0.0007155648,0.001299225,0.0009017083,0.001973114],"category_scores_gemma":[0.002756836,0.0003340463,0.0004508673,0.001381011,0.0007755517,0.001257214,0.001260369,0.0007427453,0.0007599968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009994169,"about_ca_system_score_gemma":0.0006960104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274034,"about_ca_topic_score_gemma":0.001334402,"domain_scores_codex":[0.9990103,0.0003181231,0.00005737188,0.0001351673,0.0004119893,0.00006701679],"domain_scores_gemma":[0.9993845,0.0001938945,0.0001163735,0.000106336,0.0001543037,0.00004457026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003464177,0.0001814289,0.00372861,0.001153932,0.0001116388,0.0004427824,0.0003168989,0.2816389,0.03857907,0.1346485,0.02878962,0.5100622],"study_design_scores_gemma":[0.00008859878,0.0007297879,0.003460893,0.0002192694,0.00007572294,0.001560527,0.0001066332,0.8524714,0.03095881,0.02662122,0.08363789,0.0000693636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01548152,0.00220018,0.9673153,0.0005755074,0.0002131743,0.0003020519,0.000193943,0.001643833,0.01207439],"genre_scores_gemma":[0.3730029,0.003470995,0.614632,0.0003057545,0.0001716301,0.0006193391,0.001023054,0.0004533782,0.00632108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001973114,"threshold_uncertainty_score":0.007251322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Abdulkareem Adinoyi","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0250920193219738,"gpt":0.2453892395888552,"spread":0.2202972202668814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003466717,0.001057158,0.0009643551,0.000891162,0.000542162,0.0009649465,0.0009232523,0.001163761,0.00141747],"category_scores_gemma":[0.01512271,0.0002413954,0.0004276231,0.001190333,0.001528234,0.0009996821,0.001135714,0.0006833512,0.0003684287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001406459,"about_ca_system_score_gemma":0.0009744007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005887858,"about_ca_topic_score_gemma":0.003106936,"domain_scores_codex":[0.9981501,0.0007543195,0.00003641919,0.000123292,0.0005712975,0.0003645771],"domain_scores_gemma":[0.9877187,0.008730629,0.0007944936,0.0007405339,0.001824773,0.0001907668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003492771,0.00005358657,0.001180216,0.00009328986,0.00004407012,0.0001928284,0.00008582462,0.9683051,0.004126343,0.01203397,0.001055647,0.01247987],"study_design_scores_gemma":[0.0000136122,0.00016098,0.0003629773,0.00001323656,0.0000123075,0.00008025181,0.00003111337,0.9941214,0.001962184,0.003018771,0.0002086769,0.0000144521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6819088,0.00251593,0.2813103,0.000641914,0.0001112204,0.0001565151,0.0004139405,0.0005267983,0.03241452],"genre_scores_gemma":[0.9929889,0.0003794131,0.005481434,0.00004064699,0.00001575399,0.00002989288,0.00006436979,0.00003112491,0.0009684458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005887858,"threshold_uncertainty_score":0.01833391,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fen Hou","is_ca":true},{"name":"Pin‐Han Ho","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006523415383979554,"gpt":0.2041683041592414,"spread":0.1976448887752618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004288312,0.001257045,0.001044782,0.001881554,0.001000422,0.00160131,0.00124097,0.0008906777,0.003220792],"category_scores_gemma":[0.01158246,0.0002907662,0.0005181325,0.001836132,0.001356452,0.001210756,0.0008971633,0.001020806,0.000426833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003553233,"about_ca_system_score_gemma":0.002275289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01317568,"about_ca_topic_score_gemma":0.004533344,"domain_scores_codex":[0.9970275,0.0008809041,0.00008821798,0.0001807592,0.001140795,0.0006819871],"domain_scores_gemma":[0.9931341,0.004208891,0.0007114387,0.0003479351,0.001412628,0.0001849447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005155788,0.0001330359,0.003447563,0.0001222193,0.00006566026,0.0001765518,0.0001013001,0.9323863,0.008336839,0.02442222,0.001641991,0.02865078],"study_design_scores_gemma":[0.000006230091,0.00008027579,0.0004160469,0.00000682311,0.000008495239,0.00003671538,0.00001341615,0.9976775,0.0008174508,0.000777839,0.000151177,0.000008033549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6014212,0.004702218,0.3597761,0.001055799,0.0002789789,0.0004026956,0.0003958011,0.00130339,0.03066377],"genre_scores_gemma":[0.9904935,0.0004783238,0.007392974,0.00004029275,0.00004748171,0.00006347456,0.00009530679,0.00004493498,0.001343776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01317568,"threshold_uncertainty_score":0.02619803,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mustapha Benjillali","is_ca":true},{"name":"Leszek Szczeciński","is_ca":true},{"name":"Sonia Aı̈ssa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03176887121044083,"gpt":0.2841361770211035,"spread":0.2523673058106627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003431399,0.001137981,0.0006834727,0.001525473,0.0004212911,0.0008094369,0.0013492,0.001162941,0.001787976],"category_scores_gemma":[0.01314727,0.0001666463,0.000404793,0.001362264,0.001076608,0.001098593,0.0007518844,0.0006296776,0.0004951431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00174341,"about_ca_system_score_gemma":0.000931458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005336507,"about_ca_topic_score_gemma":0.003666451,"domain_scores_codex":[0.9967276,0.0009624166,0.0001084156,0.0001838494,0.001777329,0.0002404548],"domain_scores_gemma":[0.9922751,0.004882751,0.0007160255,0.0007493352,0.001274437,0.0001023978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004949045,0.0001078072,0.004665412,0.0001446321,0.00008793767,0.0001884908,0.00006194698,0.9318663,0.01330315,0.007142022,0.001095636,0.04084177],"study_design_scores_gemma":[0.00001260575,0.0003043354,0.00124231,0.00001457128,0.00001525384,0.0001623355,0.00001634607,0.970926,0.02606738,0.0006578167,0.000555624,0.00002534544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3217483,0.001287934,0.651803,0.0002922017,0.0001185497,0.0003543512,0.0008901093,0.003759275,0.01974622],"genre_scores_gemma":[0.9073421,0.000302705,0.08948653,0.00008544979,0.00001901809,0.0001644436,0.0005685294,0.0001649801,0.001866308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005336507,"threshold_uncertainty_score":0.01814717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luqing Wang","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0218083468535529,"gpt":0.2613985935640114,"spread":0.2395902467104584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736562,0.0005794595,0.0004554375,0.00064542,0.0005576555,0.000596249,0.001076709,0.0005679649,0.002715175],"category_scores_gemma":[0.001933713,0.0001823584,0.0002978991,0.0006479875,0.0004608894,0.0006642339,0.0005527581,0.000842436,0.0008384458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003971762,"about_ca_system_score_gemma":0.0009103565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001415881,"about_ca_topic_score_gemma":0.002482081,"domain_scores_codex":[0.9995859,0.00009790281,0.00002276615,0.00006106651,0.0001991327,0.00003327921],"domain_scores_gemma":[0.9994536,0.0001733931,0.00004763378,0.00009524562,0.0002005029,0.0000296247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005106321,0.0002058576,0.000861605,0.0001397117,0.0000714439,0.0001641701,0.000151443,0.07827573,0.06006025,0.01786177,0.0120652,0.8296322],"study_design_scores_gemma":[0.0001006374,0.0002524581,0.0005034456,0.00001246775,0.00002333056,0.0002842296,0.00002159719,0.9563807,0.027261,0.002336617,0.01278834,0.0000353073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01259624,0.0002299769,0.9834298,0.0001216239,0.0001061791,0.00009937816,0.00003435082,0.0007333068,0.002649114],"genre_scores_gemma":[0.2149784,0.0002555104,0.7795586,0.0001720668,0.0001670148,0.0002269089,0.0001847949,0.0001366909,0.004319908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002715175,"threshold_uncertainty_score":0.009083152,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Majid Khabbazian","is_ca":true},{"name":"Hugues Mercier","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007356705943957545,"gpt":0.2203679692344355,"spread":0.213011263290478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009738707,0.0007952592,0.0006591914,0.001650014,0.0004014472,0.0009358712,0.0008375767,0.001108635,0.001026479],"category_scores_gemma":[0.004415078,0.0002312627,0.0005592971,0.001129002,0.0007971234,0.001691189,0.0007645768,0.000802857,0.0002889586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000847741,"about_ca_system_score_gemma":0.0006579571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007089431,"about_ca_topic_score_gemma":0.0007071617,"domain_scores_codex":[0.9985961,0.0003253276,0.00008371509,0.0000604156,0.0008389128,0.0000955792],"domain_scores_gemma":[0.9979376,0.0009469245,0.0002967638,0.000231201,0.0005378011,0.00004967085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005604058,0.000418639,0.01127134,0.0008113729,0.0003122031,0.0008673703,0.000218046,0.6073112,0.03356083,0.1113124,0.00924001,0.2241162],"study_design_scores_gemma":[0.00001527728,0.0002403522,0.001341998,0.00002731706,0.00003982356,0.0006116132,0.00003478926,0.9747489,0.009261649,0.009375297,0.004275006,0.00002802857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1765354,0.006123595,0.7838767,0.001322316,0.0003880598,0.0005106633,0.0002190578,0.002134975,0.02888926],"genre_scores_gemma":[0.9155928,0.002651254,0.07465219,0.0001430057,0.0001215416,0.000297865,0.000391814,0.00009577875,0.006053764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001650014,"threshold_uncertainty_score":0.006150842,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vincent Bricard-Vieu","is_ca":false},{"name":"Nidal Nasser","is_ca":true},{"name":"Noufissa Mikou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009823099420125637,"gpt":0.2427108264066822,"spread":0.2328877269865565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021105,0.00081992,0.000866101,0.001192105,0.0007149442,0.0005713718,0.002220829,0.0007858392,0.00119874],"category_scores_gemma":[0.001660663,0.0003227665,0.0004327313,0.001500575,0.0004410364,0.00152302,0.001037293,0.0006608344,0.000742326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005711581,"about_ca_system_score_gemma":0.0008570077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002604036,"about_ca_topic_score_gemma":0.003684681,"domain_scores_codex":[0.9993487,0.0001656339,0.00004158339,0.0001283661,0.0002656583,0.00005003211],"domain_scores_gemma":[0.9994594,0.0001228011,0.00005538441,0.00008577116,0.0002346284,0.00004195537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003331457,0.000190969,0.002372863,0.0002470132,0.0002295961,0.0001359029,0.0002062183,0.3263294,0.02545097,0.01692074,0.009238545,0.6183446],"study_design_scores_gemma":[0.00006990421,0.000167485,0.0006560692,0.00001419054,0.00004478855,0.0001520471,0.00005783933,0.9710554,0.008622822,0.005364227,0.01374894,0.00004617805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01175104,0.0004668882,0.9847514,0.0001302938,0.0001369882,0.0001276166,0.0000471458,0.001166632,0.001421925],"genre_scores_gemma":[0.2244573,0.0006334531,0.7689806,0.000158955,0.0001132756,0.0003254589,0.0005075707,0.0002719731,0.004551464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002604036,"threshold_uncertainty_score":0.005400181,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ping Wang","is_ca":true},{"name":"Hai Jiang","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02079651927425216,"gpt":0.2905020568914703,"spread":0.2697055376172182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108104,0.0004669485,0.0003807948,0.0006441683,0.0005206064,0.0005535175,0.000936982,0.0003897758,0.001067846],"category_scores_gemma":[0.00104035,0.0001897361,0.0002370663,0.0003740753,0.0005778238,0.0007958213,0.0008903723,0.0006371001,0.0004158195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003666532,"about_ca_system_score_gemma":0.0005803237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004255102,"about_ca_topic_score_gemma":0.0007930109,"domain_scores_codex":[0.9996854,0.00008569627,0.00003555497,0.00003961797,0.0001111798,0.00004262538],"domain_scores_gemma":[0.9994807,0.00009384737,0.00008484924,0.0001039908,0.000165433,0.00007136538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001383528,0.0005860981,0.003586787,0.00108592,0.0001693969,0.0006202176,0.0007087747,0.0217636,0.3678866,0.05147012,0.01110735,0.5396316],"study_design_scores_gemma":[0.0006199607,0.004399172,0.007017064,0.0001841958,0.0003345521,0.004302059,0.0002991501,0.6103271,0.2131951,0.02178521,0.1372473,0.0002891838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1964141,0.003612397,0.7820044,0.0004304249,0.0007315663,0.0005539308,0.0002793316,0.002604879,0.01336915],"genre_scores_gemma":[0.7836794,0.001116964,0.205569,0.0002456557,0.0001994658,0.0002938322,0.0005366048,0.00009634668,0.008262736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00108104,"threshold_uncertainty_score":0.005717099,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ketai Hu","is_ca":true},{"name":"Jeff Castura","is_ca":true},{"name":"Yongyi Mao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03257321272641057,"gpt":0.2841945944673079,"spread":0.2516213817408974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197796,0.0007783597,0.0007506862,0.0006972569,0.0003856573,0.0008156096,0.0007127337,0.001259365,0.001647824],"category_scores_gemma":[0.003462614,0.0002157634,0.0004815618,0.0007794552,0.0007350753,0.0008428592,0.0008602226,0.001115205,0.001376211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003908432,"about_ca_system_score_gemma":0.0008857977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001404721,"about_ca_topic_score_gemma":0.00181265,"domain_scores_codex":[0.999124,0.0002670104,0.0000427716,0.00008989992,0.0003541198,0.0001222717],"domain_scores_gemma":[0.998862,0.0003947692,0.0001097699,0.0003954337,0.0002050568,0.00003289916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004451225,0.00009741232,0.0008047462,0.0002974822,0.0001689854,0.0008111329,0.0002960459,0.3521064,0.0817818,0.1575196,0.01266134,0.3930098],"study_design_scores_gemma":[0.00004536516,0.0001103604,0.0002690814,0.00003605124,0.00002620029,0.0006362291,0.00001717159,0.8878334,0.0659113,0.0307984,0.01426424,0.00005208979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03364862,0.0006257616,0.9523941,0.0003380352,0.0001654833,0.0001057017,0.000199141,0.001865648,0.01065752],"genre_scores_gemma":[0.3809721,0.0007557318,0.6073042,0.0003254939,0.000148854,0.0001763585,0.0003595629,0.0002988592,0.009658875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001647824,"threshold_uncertainty_score":0.005512536,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Füruzan Atay Onat","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true},{"name":"Shalini Periyalwar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01940194920999795,"gpt":0.2464339209211083,"spread":0.2270319717111103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126711,0.0004347157,0.000347315,0.0004610089,0.0003290215,0.0005836859,0.0006061563,0.0006419478,0.001562319],"category_scores_gemma":[0.001350986,0.0001187651,0.0002049666,0.0006363322,0.0005835423,0.0005587861,0.0004233192,0.0003902222,0.0003699446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005721369,"about_ca_system_score_gemma":0.0006161298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001221245,"about_ca_topic_score_gemma":0.00186876,"domain_scores_codex":[0.9996102,0.0001679033,0.00001377815,0.00002992362,0.0001259146,0.00005223094],"domain_scores_gemma":[0.9995795,0.0001801842,0.00005834299,0.00006126679,0.00009871483,0.0000220445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004611695,0.00007892554,0.001456145,0.0003935686,0.00009590806,0.0007455216,0.0001531931,0.3880717,0.04061544,0.2981777,0.01121647,0.2585342],"study_design_scores_gemma":[0.0000368426,0.0003049363,0.0005428166,0.00003798156,0.00003219677,0.0005304072,0.00003243599,0.9189222,0.01782796,0.04827418,0.01342122,0.00003691631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09095809,0.005228017,0.8765869,0.0007067524,0.0002371816,0.0001254207,0.0001502424,0.0004880131,0.02551938],"genre_scores_gemma":[0.9103275,0.002316204,0.08107986,0.0001269639,0.0001346605,0.00008636717,0.00008188107,0.00002982053,0.005816745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001562319,"threshold_uncertainty_score":0.005226493,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Anna-Marie Silvester","is_ca":true},{"name":"Lutz Lampe","is_ca":true},{"name":"Robert Schober","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01464805664415205,"gpt":0.2618840590123122,"spread":0.2472360023681602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452912,0.0006275375,0.0002923771,0.0005008409,0.0002998735,0.0005860857,0.0005508494,0.0007019028,0.002908052],"category_scores_gemma":[0.002184461,0.000172997,0.0002079691,0.0007208948,0.0004373394,0.0004345427,0.0004923841,0.0006053749,0.0009595088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005735417,"about_ca_system_score_gemma":0.001101704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001619791,"about_ca_topic_score_gemma":0.002200161,"domain_scores_codex":[0.9994161,0.0001831926,0.00002578351,0.00005590268,0.0002590812,0.00005995749],"domain_scores_gemma":[0.9990996,0.0002856663,0.0001034405,0.000113364,0.0003516337,0.00004623268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003668866,0.0001112145,0.0009304787,0.0002972323,0.00005559582,0.0001772196,0.0001220989,0.480175,0.06555258,0.1650111,0.007702149,0.2794985],"study_design_scores_gemma":[0.00004166021,0.0001896348,0.0001424224,0.00002932124,0.000009641853,0.0001631813,0.00001090194,0.9579809,0.02073328,0.01293845,0.007740756,0.0000197841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01455234,0.0003244467,0.9786456,0.000146918,0.00006474005,0.00005982066,0.0001157948,0.0002646772,0.005825519],"genre_scores_gemma":[0.4231718,0.0005314803,0.5697156,0.0002002929,0.0000823759,0.0002478921,0.0004647947,0.0001035706,0.005482122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002908052,"threshold_uncertainty_score":0.009728372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Xiaodong Lin","is_ca":true},{"name":"Haojin Zhu","is_ca":true},{"name":"Bin Lin","is_ca":true},{"name":"Pin‐Han Ho","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01259922060902455,"gpt":0.2293269586742182,"spread":0.2167277380651936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003093333,0.0005180106,0.0009865989,0.001232281,0.0009874795,0.001067748,0.004200985,0.00129517,0.002609622],"category_scores_gemma":[0.006403964,0.0002628253,0.0005183087,0.0007413165,0.0009807635,0.002417686,0.002310342,0.00119843,0.0009080917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007531608,"about_ca_system_score_gemma":0.001115212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007919411,"about_ca_topic_score_gemma":0.00145113,"domain_scores_codex":[0.9975193,0.0007444739,0.0002739621,0.0003195164,0.0008338953,0.0003088165],"domain_scores_gemma":[0.9965243,0.0009030021,0.0004856233,0.001018091,0.0008224108,0.0002465574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00218848,0.0009295383,0.007294823,0.0006671491,0.0003178394,0.001114948,0.0008022641,0.07527773,0.1340777,0.1030629,0.01628863,0.6579781],"study_design_scores_gemma":[0.0003007777,0.001549335,0.001785839,0.00007406645,0.0001992843,0.001669639,0.0001760064,0.8566187,0.06491328,0.02374525,0.04879468,0.0001732668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07625119,0.0007796655,0.9050272,0.0003947828,0.0006655547,0.0008454266,0.0001421243,0.005287591,0.01060659],"genre_scores_gemma":[0.8451493,0.0002780005,0.1433291,0.0003456408,0.0001413222,0.0003900575,0.0003561556,0.0001598714,0.009850578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004200985,"threshold_uncertainty_score":0.01635927,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kuang‐Hao Liu","is_ca":true},{"name":"Lin Cai","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008378572416027385,"gpt":0.2292202724146186,"spread":0.2208416999985912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008051827,0.0003954781,0.0003865214,0.0004389809,0.0003855796,0.0005444016,0.0005816862,0.0004316908,0.001426188],"category_scores_gemma":[0.002310936,0.00007981826,0.0001804234,0.0004047571,0.000260345,0.0004221737,0.0003706302,0.0004668623,0.000365413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004038069,"about_ca_system_score_gemma":0.0005836441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341994,"about_ca_topic_score_gemma":0.001394012,"domain_scores_codex":[0.9995428,0.000114955,0.00002208013,0.00004905105,0.0001794387,0.00009168286],"domain_scores_gemma":[0.9992515,0.000320093,0.00007166216,0.00009950178,0.0002202879,0.00003692293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009624872,0.0003571192,0.001955853,0.0002289603,0.00007927408,0.0002859527,0.0001079846,0.2870627,0.1547775,0.01584473,0.004161625,0.5341758],"study_design_scores_gemma":[0.00005205601,0.0003496744,0.0006849195,0.000008916128,0.00002270566,0.0001267667,0.00001664077,0.9578605,0.03417444,0.002153991,0.004528652,0.00002076964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2461053,0.002345415,0.7282282,0.0004468337,0.0003726652,0.0001354773,0.00007561383,0.002691698,0.01959882],"genre_scores_gemma":[0.9328068,0.0003321891,0.06504948,0.00007126109,0.0000686115,0.0000512927,0.00006995306,0.00005231259,0.001498095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001426188,"threshold_uncertainty_score":0.004771054,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohamed Saad","is_ca":true},{"name":"Alberto Leon‐Garcia","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03039839090807506,"gpt":0.2793073512016679,"spread":0.2489089602935929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034027,0.0008770725,0.001351954,0.0004600701,0.0004726613,0.001987873,0.001853063,0.001630646,0.003137682],"category_scores_gemma":[0.006420703,0.0003456947,0.0003390585,0.0009349688,0.001077699,0.001561014,0.001448904,0.001179335,0.0008647075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001714323,"about_ca_system_score_gemma":0.001987599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003051356,"about_ca_topic_score_gemma":0.002653308,"domain_scores_codex":[0.9979109,0.0008653069,0.00006060536,0.0003247749,0.0005175532,0.0003208489],"domain_scores_gemma":[0.9983076,0.0007910932,0.0001852512,0.0002483682,0.0003650306,0.0001026375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003261039,0.0001022982,0.0009261702,0.0001427874,0.00004007935,0.0001610037,0.0001235716,0.8077558,0.006258443,0.06950631,0.008791185,0.1058662],"study_design_scores_gemma":[0.00003639476,0.00006452009,0.0001869008,0.000009510743,0.000004911648,0.00006375824,0.00001611377,0.9820133,0.001709007,0.0140082,0.001881115,0.000006323406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04485626,0.0003436523,0.9385028,0.0008643068,0.00009223642,0.0002366047,0.000230543,0.0008762456,0.01399736],"genre_scores_gemma":[0.6627898,0.0003434755,0.3272132,0.000381093,0.000160279,0.0003436382,0.0004186893,0.000318653,0.008031041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0034027,"threshold_uncertainty_score":0.01799536,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeebak Mitra","is_ca":true},{"name":"Lutz Lampe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01221721211136986,"gpt":0.2059443856994251,"spread":0.1937271735880552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192201,0.00061541,0.0006085299,0.0004331969,0.0002339388,0.0008687542,0.0005252305,0.0008862566,0.001449514],"category_scores_gemma":[0.004388845,0.0001512786,0.0002889173,0.0005133408,0.0007529358,0.000743795,0.0007259965,0.0005220399,0.0004789602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007633491,"about_ca_system_score_gemma":0.001042437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431564,"about_ca_topic_score_gemma":0.001557922,"domain_scores_codex":[0.999177,0.0002713742,0.00003000863,0.00008410503,0.000327137,0.0001103337],"domain_scores_gemma":[0.9986501,0.0008539747,0.000145786,0.0001458572,0.0001805828,0.00002366414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002700461,0.00002843468,0.001004668,0.0001293423,0.00004848051,0.000159108,0.00007870197,0.8447052,0.01712277,0.09814237,0.001099682,0.03721122],"study_design_scores_gemma":[0.000008060329,0.00005010845,0.0001078581,0.00001081738,0.000006148676,0.00008527149,0.000007169771,0.9804597,0.007932125,0.01047612,0.0008481137,0.000008497344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05595797,0.0003796008,0.9375141,0.0001659424,0.00002888932,0.0000257211,0.0001095414,0.0004431821,0.005375099],"genre_scores_gemma":[0.7932291,0.0005483928,0.2004708,0.0001539378,0.00004513122,0.0000704379,0.0002961805,0.0001665305,0.005019557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001449514,"threshold_uncertainty_score":0.006305039,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jun Li","is_ca":false},{"name":"Zhen Wu","is_ca":false},{"name":"Eric Purpus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01302629165740183,"gpt":0.2194323484611793,"spread":0.2064060568037775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008829852,0.0004697641,0.0004412601,0.001243754,0.00040266,0.001069581,0.0006412786,0.000977573,0.001137701],"category_scores_gemma":[0.005454588,0.0001931296,0.0001800232,0.001633815,0.0005010482,0.001900246,0.0003918245,0.0007597078,0.0002403831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008396715,"about_ca_system_score_gemma":0.000489275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01908899,"about_ca_topic_score_gemma":0.01983908,"domain_scores_codex":[0.9997844,0.00006729155,0.00001180502,0.00004247547,0.00006362571,0.00003043661],"domain_scores_gemma":[0.9977452,0.0007708715,0.0006042137,0.0003543354,0.0004132774,0.0001120166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003708145,0.0004615807,0.359098,0.0003204022,0.0001839527,0.0006078733,0.001107703,0.4749818,0.02825514,0.02963647,0.01516,0.08981635],"study_design_scores_gemma":[0.00001563144,0.00009819417,0.08709058,0.00001993454,0.00001727637,0.0001118342,0.0001985611,0.8980102,0.0039373,0.007932571,0.002548334,0.00001959332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9271871,0.0005133959,0.06270051,0.0009525002,0.00004693564,0.00006913088,0.002163644,0.001023635,0.005343103],"genre_scores_gemma":[0.9813949,0.0002113726,0.01618039,0.00009065128,0.00003978856,0.00003689669,0.001494128,0.00006165395,0.000490282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01908899,"threshold_uncertainty_score":0.03795576,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mona Mehrandish","is_ca":true},{"name":"Hadi Otrok","is_ca":true},{"name":"Mourad Debbabi","is_ca":true},{"name":"Chadi Assi","is_ca":true},{"name":"Paritosh Bhattacharya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008616222734882701,"gpt":0.2110690335392339,"spread":0.2024528108043512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00442685,0.001085323,0.001320445,0.001117882,0.0007922443,0.001903742,0.002934417,0.002168532,0.001663949],"category_scores_gemma":[0.006694544,0.0004996905,0.001190349,0.0008278555,0.002267682,0.002136891,0.001781557,0.001970394,0.0002678516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002550238,"about_ca_system_score_gemma":0.002701392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004730504,"about_ca_topic_score_gemma":0.004764701,"domain_scores_codex":[0.9960445,0.002414951,0.0001278221,0.0003283777,0.0007896642,0.0002946691],"domain_scores_gemma":[0.9955806,0.002956911,0.0003462033,0.0002876327,0.0005112624,0.0003174009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001456261,0.0002085283,0.001160786,0.0001311145,0.0001382825,0.0003120776,0.0001701994,0.7864424,0.002652576,0.1880016,0.00242789,0.01820897],"study_design_scores_gemma":[0.00001916116,0.00004546213,0.00008391075,0.000006403559,0.00001422728,0.00006928684,0.00002585024,0.9674802,0.0004714218,0.0304852,0.001288736,0.00001008825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02459515,0.0002246328,0.9604969,0.0009424685,0.00008663638,0.0003497682,0.0001189358,0.0002428191,0.01294274],"genre_scores_gemma":[0.6669922,0.0003382684,0.3252377,0.0005364661,0.00009211576,0.0003994085,0.0001575384,0.00005941398,0.006186882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004730504,"threshold_uncertainty_score":0.02341169,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jia Liu","is_ca":true},{"name":"Witold A. Krzymień","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01512560698265545,"gpt":0.2282686391045422,"spread":0.2131430321218868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007668615,0.000883883,0.0006851984,0.0005011612,0.0004650583,0.0009443847,0.001052829,0.001047879,0.0032224],"category_scores_gemma":[0.001090787,0.0003286663,0.0004066956,0.0007332122,0.0004758266,0.001003272,0.0008447502,0.001103917,0.001892606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006320122,"about_ca_system_score_gemma":0.001734977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002514655,"about_ca_topic_score_gemma":0.004194159,"domain_scores_codex":[0.9995446,0.0001046285,0.00002284235,0.0000598857,0.0002186829,0.00004932461],"domain_scores_gemma":[0.9996638,0.00008617993,0.00004368007,0.00005021488,0.0001355958,0.00002042828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002253072,0.0001236671,0.0007337045,0.0001616477,0.00005672987,0.00008551965,0.0001072024,0.4223424,0.02273761,0.03051357,0.008481295,0.5144314],"study_design_scores_gemma":[0.00003007652,0.00006630837,0.0001288601,0.000008063043,0.000004667751,0.00005433782,0.000008781261,0.9859044,0.00586345,0.002617265,0.005297804,0.00001585813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002330517,0.00006127065,0.9959799,0.00005104062,0.00002192765,0.00002733165,0.00003531662,0.0002256681,0.001267044],"genre_scores_gemma":[0.05035976,0.0001085699,0.9449769,0.00008942048,0.00003038934,0.0001346097,0.0002616156,0.00007951129,0.00395931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0032224,"threshold_uncertainty_score":0.01078004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Leszek Szczeciński","is_ca":true},{"name":"Mustapha Benjillali","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01130323593310065,"gpt":0.24638204009544,"spread":0.2350788041623393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00429259,0.001042263,0.0009517586,0.001395862,0.0006809096,0.002027248,0.001912765,0.001882298,0.004682893],"category_scores_gemma":[0.02170445,0.0006203922,0.0008726706,0.002019192,0.002024098,0.0024687,0.001336494,0.002343358,0.001662713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002191219,"about_ca_system_score_gemma":0.001318913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003128499,"about_ca_topic_score_gemma":0.001691265,"domain_scores_codex":[0.997991,0.001041713,0.00006015197,0.0001410155,0.0005859915,0.0001800889],"domain_scores_gemma":[0.9934216,0.004800312,0.0003945045,0.0004908873,0.0007869488,0.0001058408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001222039,0.00003162909,0.0008596649,0.0001626922,0.00003136673,0.0002875513,0.0001692343,0.3414675,0.001375443,0.6141871,0.00563535,0.03567023],"study_design_scores_gemma":[0.0000142653,0.00002990596,0.000311278,0.00005048887,0.00000978509,0.0002662961,0.00002259745,0.8720235,0.0009874895,0.1220511,0.004195775,0.0000374579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005988729,0.001560407,0.9820837,0.0004291311,0.000127748,0.00006292723,0.0001339543,0.0003726881,0.009240774],"genre_scores_gemma":[0.6526209,0.004263604,0.3204474,0.0009909074,0.0007012849,0.0005822067,0.0006141153,0.0004815137,0.01929809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004682893,"threshold_uncertainty_score":0.02270168,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Petar Djukic","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006739201112815851,"gpt":0.1960580406264807,"spread":0.1893188395136648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945342,0.001063729,0.000704593,0.001087904,0.0007441977,0.001948194,0.002754776,0.001266777,0.003842553],"category_scores_gemma":[0.003695289,0.0005163919,0.000498452,0.00101462,0.0007287338,0.001557977,0.001131116,0.001732429,0.001985988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485786,"about_ca_system_score_gemma":0.002476794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005847645,"about_ca_topic_score_gemma":0.007909364,"domain_scores_codex":[0.9987434,0.0002420639,0.0001143574,0.000084572,0.0006564526,0.0001591634],"domain_scores_gemma":[0.9984238,0.0002282855,0.0001816087,0.0003770013,0.0006994428,0.00008974923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001223885,0.0003938606,0.003015309,0.002685193,0.0005414401,0.0008006729,0.0004521499,0.2478395,0.09751784,0.08114567,0.1112916,0.4530929],"study_design_scores_gemma":[0.0003049203,0.000569678,0.0006993573,0.0001697906,0.0001415834,0.0003413888,0.00004897762,0.767578,0.07235595,0.009932221,0.1477233,0.0001348228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01902121,0.002405621,0.9506406,0.0009524304,0.0006791776,0.001136809,0.001082216,0.01307017,0.01101162],"genre_scores_gemma":[0.3412694,0.003807715,0.610932,0.001149088,0.0003671579,0.00272048,0.004937798,0.001515843,0.03330044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005847645,"threshold_uncertainty_score":0.01285464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"Xiaodi Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01091214499077551,"gpt":0.220901513383937,"spread":0.2099893683931615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763978,0.001071256,0.001127114,0.0007275257,0.0004027931,0.0008634503,0.001300064,0.0009989837,0.002612167],"category_scores_gemma":[0.009431272,0.0003213008,0.0002652523,0.001035494,0.001210281,0.0008605131,0.0008905254,0.0005419398,0.0006957391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009065545,"about_ca_system_score_gemma":0.001037294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001811506,"about_ca_topic_score_gemma":0.003207797,"domain_scores_codex":[0.9982444,0.0009738156,0.00008152545,0.0001180154,0.0003716373,0.0002106345],"domain_scores_gemma":[0.9942955,0.004065924,0.0004830879,0.0004290163,0.0005908855,0.0001354781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001720443,0.0001303284,0.00553712,0.0005008345,0.0001453578,0.0004700384,0.00009153639,0.7020789,0.02648847,0.0265785,0.005825655,0.2304327],"study_design_scores_gemma":[0.0001752796,0.0007649076,0.002178117,0.0001290699,0.00006806866,0.0005208968,0.00006807346,0.9558278,0.01844663,0.01778207,0.003975108,0.00006399259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1804855,0.004048742,0.7765906,0.001025545,0.0002205445,0.0002618286,0.0002673678,0.0006110282,0.03648881],"genre_scores_gemma":[0.7958384,0.001033348,0.1993499,0.0002459527,0.0001336482,0.0001109268,0.0001423568,0.00006055642,0.003084901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002763978,"threshold_uncertainty_score":0.01461744,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lacra Pavel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006190928254146906,"gpt":0.2106949013831338,"spread":0.2045039731289869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730541,0.001053903,0.001190376,0.0007232946,0.0006885372,0.0009841889,0.002031545,0.001420356,0.005958035],"category_scores_gemma":[0.004115206,0.0005696043,0.0006582211,0.0005707429,0.001070538,0.00112972,0.002538604,0.001274251,0.001017837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164291,"about_ca_system_score_gemma":0.002776848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006896793,"about_ca_topic_score_gemma":0.009111252,"domain_scores_codex":[0.9991678,0.0003291706,0.00003010822,0.0001186575,0.0002128541,0.000141425],"domain_scores_gemma":[0.9987261,0.0008164792,0.00009020387,0.00009087156,0.0001999307,0.0000763959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001069294,0.00006855023,0.0005655926,0.00007303547,0.0000299107,0.00008715563,0.0001493154,0.8928445,0.001337054,0.05786783,0.001956953,0.04491318],"study_design_scores_gemma":[0.00001810083,0.00001541403,0.00002099069,0.000004222969,0.000002577351,0.000008230912,0.000008756015,0.9927834,0.0001789954,0.006518318,0.00043733,0.000003629335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006578547,0.00004345016,0.9873612,0.00008925918,0.00001510103,0.0001094212,0.00003364636,0.0002774039,0.005491932],"genre_scores_gemma":[0.2991636,0.00008835901,0.694935,0.0001912007,0.00002617708,0.0005795956,0.0001589912,0.0001352435,0.00472185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006896793,"threshold_uncertainty_score":0.01993155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yu Fu","is_ca":true},{"name":"Witold A. Krzymień","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009497136022408759,"gpt":0.2235646794019341,"spread":0.2140675433795253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822081,0.0005604308,0.0004200351,0.0001967232,0.0002833928,0.0005521649,0.00042966,0.0005119418,0.001501727],"category_scores_gemma":[0.001259271,0.0001433073,0.000230378,0.0004232038,0.0004596559,0.0005124557,0.0003695501,0.0004541404,0.0005072888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002862383,"about_ca_system_score_gemma":0.0007339865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001009627,"about_ca_topic_score_gemma":0.002939601,"domain_scores_codex":[0.9996417,0.0001088749,0.00001818764,0.00004841738,0.0001508006,0.00003200566],"domain_scores_gemma":[0.9995846,0.0001453835,0.00005102306,0.00007413079,0.0001315527,0.00001337201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002292532,0.0001261854,0.000933225,0.0004011667,0.000101401,0.0003912349,0.0001774783,0.4984917,0.08098868,0.07599831,0.006682851,0.3354785],"study_design_scores_gemma":[0.00001941337,0.0001564531,0.0002886818,0.00001754612,0.00001358362,0.0001560457,0.00001718379,0.9717675,0.01784276,0.005195249,0.004511348,0.00001422539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01167591,0.0002500884,0.9852585,0.00009997112,0.00006501548,0.00003075812,0.00003706442,0.0001141384,0.00246854],"genre_scores_gemma":[0.4989659,0.001003063,0.4893258,0.0002663103,0.0002179424,0.00014147,0.0002385158,0.00007370222,0.009767244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001501727,"threshold_uncertainty_score":0.005023837,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Veluppillai Mahinthan","is_ca":true},{"name":"J.W. Mark","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02126807642517115,"gpt":0.2222282930342761,"spread":0.2009602166091049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632279,0.0004832764,0.0006521897,0.0005568585,0.0005811977,0.0008423762,0.001073904,0.0008828646,0.001085606],"category_scores_gemma":[0.00082577,0.0001683231,0.0002541891,0.0007579665,0.0005010845,0.0006107858,0.00067001,0.0004381477,0.0004847259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004078324,"about_ca_system_score_gemma":0.0006550921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001407136,"about_ca_topic_score_gemma":0.002226386,"domain_scores_codex":[0.9994037,0.000174785,0.00002861319,0.0001014443,0.0001963459,0.00009514282],"domain_scores_gemma":[0.9995146,0.0000932697,0.00006935964,0.00006145861,0.0002215634,0.00003968452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001054459,0.0004469265,0.004565595,0.0004038046,0.0002089268,0.001379444,0.0004149216,0.1191159,0.3422432,0.08491117,0.01155224,0.4337034],"study_design_scores_gemma":[0.0002767918,0.001252821,0.001351508,0.00004566566,0.0001021382,0.001294068,0.00005647617,0.9334126,0.03725119,0.007181715,0.01767782,0.00009717123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1250665,0.0009324286,0.8610322,0.0006964287,0.0002576727,0.0003068657,0.0001529556,0.0009268688,0.01062804],"genre_scores_gemma":[0.8838083,0.0003144224,0.1102166,0.0003270407,0.00008395319,0.0001934821,0.0001560937,0.00001186656,0.004888317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001407136,"threshold_uncertainty_score":0.004036367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005415059572164994,"gpt":0.2308053126289703,"spread":0.2253902530568053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208789,0.0006723361,0.0004263237,0.0008832159,0.0004072964,0.001559675,0.001190125,0.0009556686,0.007792804],"category_scores_gemma":[0.004436494,0.000209986,0.0004394557,0.001295624,0.0007569141,0.001692937,0.0007453361,0.001475658,0.00385863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007314382,"about_ca_system_score_gemma":0.001181246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508183,"about_ca_topic_score_gemma":0.001816732,"domain_scores_codex":[0.9995926,0.00006163986,0.00001747674,0.00004316884,0.0002527603,0.00003232285],"domain_scores_gemma":[0.9991482,0.0002636193,0.00008139649,0.0001401673,0.0003299235,0.00003671785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001121006,0.00007473479,0.0009980694,0.0003212644,0.00002613873,0.0005065104,0.0002205207,0.1209413,0.03223225,0.6569154,0.02354154,0.1641101],"study_design_scores_gemma":[0.00001648158,0.00003573038,0.0005215913,0.00005639005,0.00001196136,0.0009631692,0.00004955419,0.8200356,0.006151645,0.1323339,0.0397752,0.00004877258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001996456,0.0002199748,0.9878798,0.00009547084,0.0001081897,0.00003950631,0.000115326,0.0004047958,0.009140528],"genre_scores_gemma":[0.2302622,0.001761946,0.7376081,0.0004575837,0.0003691145,0.0003282228,0.0007488967,0.001278451,0.02718545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007792804,"threshold_uncertainty_score":0.02606952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Xiaojiang Du","is_ca":false},{"name":"Sghaier Guizani","is_ca":true},{"name":"Yang Xiao","is_ca":false},{"name":"Hsiao‐Hwa Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01212539059909993,"gpt":0.2544184762536493,"spread":0.2422930856545494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001394147,0.0005956474,0.0006801627,0.0008367526,0.0009520267,0.0008366674,0.00190003,0.0009930643,0.002313939],"category_scores_gemma":[0.002272358,0.0002935211,0.0005930776,0.0009243023,0.0006659114,0.001482073,0.001968792,0.001295971,0.001113537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000925765,"about_ca_system_score_gemma":0.001882579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341407,"about_ca_topic_score_gemma":0.003341905,"domain_scores_codex":[0.999011,0.000265171,0.0001020339,0.0000630679,0.0004736792,0.00008499219],"domain_scores_gemma":[0.9993336,0.000153287,0.0000849377,0.0001789197,0.0001963336,0.00005298791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001124387,0.0003838942,0.001522013,0.001108102,0.0002896611,0.001357408,0.0005884662,0.1946584,0.09049765,0.231393,0.08700696,0.3900701],"study_design_scores_gemma":[0.0003236957,0.0004558227,0.0007023821,0.00009281807,0.000154242,0.001070081,0.0001050785,0.6777855,0.04297382,0.05356522,0.2226028,0.0001686367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01397046,0.001309371,0.9593496,0.0007245836,0.0006005403,0.0009412863,0.0005858117,0.005780971,0.01673736],"genre_scores_gemma":[0.3707378,0.001689174,0.5923578,0.001351844,0.0001761804,0.0022233,0.00442231,0.0007243836,0.02631726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002313939,"threshold_uncertainty_score":0.007740915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chao-Chin Chou","is_ca":false},{"name":"David S. L. Wei","is_ca":false},{"name":"C.‐C. Jay Kuo","is_ca":false},{"name":"Kshirasagar Naik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007961364483059051,"gpt":0.2637176349755488,"spread":0.2557562704924898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304297,0.0005721628,0.00079562,0.0007844671,0.0007199061,0.001075776,0.001598162,0.0008325994,0.001583027],"category_scores_gemma":[0.001854903,0.000244744,0.0004144698,0.0009030505,0.000583727,0.001513357,0.001095153,0.0008482501,0.0008948424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004859234,"about_ca_system_score_gemma":0.001060107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007737557,"about_ca_topic_score_gemma":0.001399592,"domain_scores_codex":[0.9989134,0.0003563527,0.0001104003,0.0001079731,0.0004203609,0.00009153142],"domain_scores_gemma":[0.9993697,0.000137978,0.0001100841,0.0001285732,0.000214571,0.00003911303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006459162,0.0004001874,0.002495973,0.002037107,0.0004355807,0.001589153,0.0006483543,0.1723906,0.06785386,0.1604283,0.0401077,0.5509672],"study_design_scores_gemma":[0.0001858491,0.0008119714,0.00159655,0.0001079372,0.0002358212,0.002510648,0.0001992847,0.6616689,0.04933952,0.03455929,0.2486144,0.0001698152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01953694,0.001186879,0.9639625,0.0003398783,0.0003794468,0.000571888,0.0002845205,0.003789717,0.009948184],"genre_scores_gemma":[0.4536031,0.002059247,0.5279803,0.0003994313,0.0001767462,0.001130086,0.001512667,0.0002892881,0.0128491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001598162,"threshold_uncertainty_score":0.006897867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Praveen Kaligineedi","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007263845968909205,"gpt":0.2158088986476419,"spread":0.2085450526787327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536447,0.0003724649,0.0002733295,0.0004202865,0.0002175629,0.0004044067,0.0003094831,0.0004594474,0.003497186],"category_scores_gemma":[0.0006747307,0.0000835549,0.0001571405,0.0004090522,0.0001946264,0.0004803647,0.0001607304,0.0003575807,0.0009503677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002251734,"about_ca_system_score_gemma":0.0002783609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006729962,"about_ca_topic_score_gemma":0.0009765569,"domain_scores_codex":[0.9998018,0.000033364,0.00001490626,0.00001864034,0.0001034692,0.00002790247],"domain_scores_gemma":[0.9997593,0.00008234089,0.00002989274,0.00002781239,0.00009413181,0.000006546979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007120511,0.0001881825,0.001504659,0.000457443,0.00009438214,0.0002542512,0.00009453033,0.04955062,0.3590302,0.0104706,0.004467435,0.5731757],"study_design_scores_gemma":[0.0001440275,0.001012181,0.004797167,0.00006381532,0.00006366706,0.001529639,0.00004871672,0.4629307,0.4850895,0.003883266,0.04037422,0.00006313577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1029909,0.002450082,0.8841609,0.000261091,0.0001809232,0.0001149016,0.0001567226,0.0009681215,0.008716356],"genre_scores_gemma":[0.6992358,0.001726106,0.2826205,0.0001783896,0.0001100692,0.0001084288,0.0002997309,0.0001113316,0.01560976],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003497186,"threshold_uncertainty_score":0.01169926,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hai Jiang","is_ca":true},{"name":"Kuang‐Hao Liu","is_ca":true},{"name":"Weihua Zhuang","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004667674310808734,"gpt":0.2027009196458525,"spread":0.1980332453350438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451394,0.0004505734,0.0004272474,0.0004328276,0.0003936514,0.0009438188,0.001098619,0.0007616074,0.001383108],"category_scores_gemma":[0.001570055,0.0001917605,0.0003109752,0.0005643435,0.0006068268,0.0008478033,0.0005993933,0.000882347,0.0004624594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005180916,"about_ca_system_score_gemma":0.0006702716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009175971,"about_ca_topic_score_gemma":0.0009601064,"domain_scores_codex":[0.9991702,0.000230833,0.00006463812,0.0001301884,0.0003498569,0.00005431097],"domain_scores_gemma":[0.9995701,0.0001412475,0.00004607487,0.00007578755,0.0001356787,0.00003109733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006929659,0.000347291,0.002279496,0.0008551826,0.0001940801,0.0006745923,0.0004149407,0.2059719,0.06630907,0.1833019,0.0158991,0.5230595],"study_design_scores_gemma":[0.0001466883,0.000575837,0.0007824276,0.00007405866,0.00006665384,0.0005886225,0.00005467152,0.8729391,0.03424143,0.01617818,0.07430998,0.00004227049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01278351,0.002111645,0.9762074,0.0002708076,0.0004039718,0.0001238923,0.00004316066,0.0006406824,0.007414867],"genre_scores_gemma":[0.5341819,0.003941348,0.4366113,0.0005026385,0.0006307092,0.0006455915,0.0006055778,0.0002058308,0.02267516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001451394,"threshold_uncertainty_score":0.007675767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Tao Jia","is_ca":true},{"name":"Dong In Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005941723893070796,"gpt":0.1846036358980633,"spread":0.1786619120049925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008667045,0.0006365678,0.0006307777,0.0004122578,0.0003902778,0.0007787384,0.0006171698,0.0008155746,0.001376529],"category_scores_gemma":[0.002239098,0.0001377749,0.000363739,0.0005211741,0.0005620546,0.0006706573,0.0004894116,0.0003871534,0.0002752891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006340853,"about_ca_system_score_gemma":0.0005435328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002191005,"about_ca_topic_score_gemma":0.001558903,"domain_scores_codex":[0.9991629,0.0002169183,0.00002708565,0.000107047,0.0002741124,0.0002119808],"domain_scores_gemma":[0.9982842,0.0007326158,0.0002077115,0.0002144548,0.0004775328,0.00008353704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003956734,0.0001930492,0.01317455,0.0003486019,0.0005562024,0.001963156,0.0004715749,0.5674872,0.3526546,0.01508575,0.0009941281,0.04311446],"study_design_scores_gemma":[0.00005601065,0.0009043695,0.004130017,0.00001888459,0.0001062296,0.0007791983,0.00008399946,0.9232509,0.06879617,0.001240853,0.00056911,0.00006415794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9247609,0.0003854504,0.07141326,0.00008269911,0.00003193739,0.00002263034,0.0001054086,0.0002922486,0.002905395],"genre_scores_gemma":[0.9960226,0.00005208077,0.003526089,0.00001611889,0.000005670985,0.000007855675,0.00004632605,0.00001383399,0.0003094505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002191005,"threshold_uncertainty_score":0.004604995,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Jun-Bae Seo","is_ca":true},{"name":"Hyong-Woo Lee","is_ca":false},{"name":"Choong-Ho Cho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005882493184886254,"gpt":0.2365693963863262,"spread":0.2306869032014399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200935,0.0008619197,0.0007892528,0.0008198625,0.000552991,0.001064599,0.001005974,0.0007242558,0.002652103],"category_scores_gemma":[0.006689374,0.000170093,0.0005256191,0.0008507858,0.0007461815,0.001162378,0.0005948617,0.0006174439,0.0004381893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002009609,"about_ca_system_score_gemma":0.001861515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0149134,"about_ca_topic_score_gemma":0.004192653,"domain_scores_codex":[0.9983424,0.0004527959,0.00005208417,0.0001818967,0.0004467999,0.0005240256],"domain_scores_gemma":[0.9961726,0.001924431,0.0003481004,0.0003042917,0.001120294,0.000130322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005562366,0.0002300317,0.003708219,0.0001150219,0.00007305894,0.0002018005,0.00007194019,0.9450105,0.01063532,0.01525399,0.003204011,0.02093976],"study_design_scores_gemma":[0.000006092201,0.00005795696,0.0004463164,0.000003558616,0.000006126553,0.00001801745,0.0000108409,0.9972952,0.001461931,0.0005935933,0.00009356112,0.000006754503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7267927,0.002177766,0.2486428,0.0006139343,0.000215031,0.0001408226,0.0005783302,0.002963171,0.01787549],"genre_scores_gemma":[0.9935215,0.0001595372,0.004902674,0.00003924803,0.00002011629,0.00002771927,0.0001689382,0.00008986723,0.001070475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0149134,"threshold_uncertainty_score":0.02965319,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Zohreh Motamedi","is_ca":true},{"name":"M. Reza Soleymani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007976712373596593,"gpt":0.2061068402519395,"spread":0.1981301278783429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003248126,0.001660425,0.001584084,0.0009753164,0.000622644,0.0017178,0.0009045764,0.001320117,0.003405413],"category_scores_gemma":[0.01529409,0.000516785,0.0004081287,0.00145318,0.002606626,0.002240722,0.001645539,0.001386459,0.0007174364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001456546,"about_ca_system_score_gemma":0.001400188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002834776,"about_ca_topic_score_gemma":0.001570849,"domain_scores_codex":[0.9982375,0.001047808,0.00004547499,0.0001189647,0.0003382389,0.0002120435],"domain_scores_gemma":[0.9896583,0.008435781,0.0003782941,0.0002700021,0.001011343,0.0002463201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001358295,0.00006013964,0.0007935946,0.0002235872,0.00006119713,0.0001336797,0.00009077031,0.8640442,0.002208445,0.1141246,0.00527012,0.01285382],"study_design_scores_gemma":[0.00001471558,0.00007579039,0.000248199,0.00003852165,0.00001091956,0.00004017098,0.00003321499,0.9476232,0.0005010846,0.05071261,0.000689252,0.00001236117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1089887,0.005628299,0.8282625,0.003013764,0.0002889274,0.0001445629,0.000573478,0.0002923647,0.05280736],"genre_scores_gemma":[0.9296018,0.004636283,0.05804808,0.000441891,0.000553539,0.0002028728,0.0003096631,0.0002120999,0.005993746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003405413,"threshold_uncertainty_score":0.01717794,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sylvia Tai","is_ca":true},{"name":"Robert Benkoczi","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008983945914421487,"gpt":0.2109318960322574,"spread":0.201947950117836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262714,0.001038074,0.0005258181,0.0007986847,0.0003645275,0.0004404465,0.0007523792,0.0006660993,0.001020395],"category_scores_gemma":[0.003051237,0.0002323018,0.0005784227,0.001178808,0.0004255048,0.001380403,0.0003799046,0.0005442626,0.0001114202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009560575,"about_ca_system_score_gemma":0.0004188719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002037366,"about_ca_topic_score_gemma":0.002204503,"domain_scores_codex":[0.9993951,0.0002551636,0.00002830744,0.0000675759,0.0001737905,0.00007999956],"domain_scores_gemma":[0.9977326,0.001606724,0.0001816828,0.0001376633,0.0002722837,0.00006901158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002229579,0.0003108527,0.003652499,0.0003088016,0.0001164437,0.0002298976,0.00005292755,0.9549748,0.01517684,0.006742772,0.0009729469,0.01723836],"study_design_scores_gemma":[0.00001467099,0.0002932028,0.001438909,0.00001270228,0.00002369302,0.0001479195,0.00005376825,0.989545,0.005881926,0.001831517,0.0007468629,0.000009670107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8976859,0.002186923,0.09064057,0.0005938347,0.0001122606,0.0001405567,0.0003864683,0.0001361123,0.008117308],"genre_scores_gemma":[0.9805678,0.001560947,0.01574289,0.00006256533,0.00003463136,0.00007640178,0.0002750421,0.00005112934,0.001628714],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002037366,"threshold_uncertainty_score":0.006936729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Computer science; Wireless network; Wireless; Quality of service; Telecommunications","authors":[{"name":"Ian W. C. Lee","is_ca":true},{"name":"Abraham O. Fapojuwo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00761181839861558,"gpt":0.2139359930435849,"spread":0.2063241746449693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231822,0.0005398191,0.0004481037,0.0006160779,0.0003817436,0.0008151943,0.001107674,0.001000969,0.001375324],"category_scores_gemma":[0.003564918,0.0003067296,0.0005867089,0.0006893674,0.0005498881,0.001035751,0.0004912005,0.0009648849,0.0004727866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008172838,"about_ca_system_score_gemma":0.0009397862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01051603,"about_ca_topic_score_gemma":0.004625712,"domain_scores_codex":[0.9995203,0.0001262159,0.00002785293,0.00008857943,0.0001616508,0.00007529263],"domain_scores_gemma":[0.998871,0.0004427203,0.0002027831,0.000121958,0.0003109182,0.00005052906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003270974,0.00006083504,0.003549793,0.0000298759,0.0000153946,0.0001240819,0.00006340846,0.9640335,0.003978237,0.01877313,0.0006789718,0.008660085],"study_design_scores_gemma":[9.180798e-7,0.000006363385,0.0002034054,8.428269e-7,0.000001560742,0.000008262584,0.000002055471,0.9984586,0.0002254558,0.0009816003,0.0001089577,0.000001892328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1624606,0.0002045753,0.8327295,0.0002558671,0.00005752809,0.0001419395,0.0003452729,0.0004099438,0.003394721],"genre_scores_gemma":[0.9611666,0.0003560254,0.03447193,0.00005240508,0.00005354791,0.0001742846,0.0002675152,0.000044959,0.003412868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051603,"threshold_uncertainty_score":0.02090961,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jinhui Shen","is_ca":true},{"name":"Ioanis Nikolaidis","is_ca":true},{"name":"Janelle Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0132817911508468,"gpt":0.2621202402095449,"spread":0.2488384490586981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350589,0.0004421494,0.0006475667,0.000821051,0.0007752876,0.0009110481,0.002065842,0.0004298616,0.002175252],"category_scores_gemma":[0.001153071,0.0002406908,0.0003435945,0.0008923231,0.0006963979,0.0007736507,0.0009583886,0.0006188792,0.0006900185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344291,"about_ca_system_score_gemma":0.001627404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00326989,"about_ca_topic_score_gemma":0.003496198,"domain_scores_codex":[0.9993248,0.000122481,0.00005551612,0.0001009434,0.0002376008,0.000158784],"domain_scores_gemma":[0.9994413,0.00007638713,0.00008186082,0.0001905531,0.0001432032,0.00006670856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008972192,0.0003469482,0.001432467,0.0002225811,0.0001315834,0.0002580849,0.0002611774,0.1960629,0.1034443,0.129062,0.0183308,0.5495501],"study_design_scores_gemma":[0.0001087753,0.0002078735,0.0007637722,0.00001918479,0.00004022235,0.0001597883,0.00002876347,0.8925304,0.05554369,0.02150398,0.02904137,0.00005209808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03926705,0.0003713753,0.950492,0.000166286,0.0002061355,0.0001634397,0.0001274433,0.002660244,0.006545975],"genre_scores_gemma":[0.6697328,0.0002617827,0.3235158,0.0001790845,0.0001392018,0.0002580259,0.0003748371,0.0002435333,0.005294938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00326989,"threshold_uncertainty_score":0.009753585,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chris Snow","is_ca":true},{"name":"Lutz Lampe","is_ca":true},{"name":"Robert Schober","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01629084616820636,"gpt":0.2510965143253447,"spread":0.2348056681571384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075097,0.00142933,0.0006519663,0.001864941,0.0004595002,0.00107811,0.0009381633,0.0008306511,0.002574207],"category_scores_gemma":[0.01340006,0.0002793086,0.0005567929,0.001189225,0.0009883976,0.001759862,0.0006813818,0.001329644,0.001071842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251012,"about_ca_system_score_gemma":0.001180292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003919993,"about_ca_topic_score_gemma":0.002206584,"domain_scores_codex":[0.9980783,0.0005024653,0.00007104131,0.0001388737,0.001047119,0.0001620776],"domain_scores_gemma":[0.9931725,0.004203692,0.000586079,0.000581988,0.001404973,0.00005077167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000105663,0.00007033309,0.001370809,0.0003056176,0.00007816028,0.0002253539,0.0001670717,0.8360208,0.01132281,0.09607936,0.004211388,0.05004278],"study_design_scores_gemma":[0.000002023921,0.00001965878,0.000267489,0.00001769863,0.000006327525,0.00006384342,0.00001042926,0.9919841,0.001919164,0.004873628,0.0008253185,0.00001040859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008872374,0.001009478,0.9859324,0.0001580593,0.00005764465,0.00003435128,0.0001182568,0.0002192915,0.003598226],"genre_scores_gemma":[0.7460978,0.006155198,0.2330925,0.0004017419,0.0004393762,0.0003559499,0.0007750683,0.0005662587,0.01211617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003919993,"threshold_uncertainty_score":0.01626283,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Zhengang Chen","is_ca":true},{"name":"Stephen Bates","is_ca":true},{"name":"D.G. Elliott","is_ca":true},{"name":"T.L. Brandon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007769916617639139,"gpt":0.2334236396745022,"spread":0.225653723056863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006265123,0.00040097,0.0003250603,0.0005520944,0.0003983775,0.0005642295,0.0006416307,0.0005392128,0.002076107],"category_scores_gemma":[0.00168849,0.0001112388,0.0001850478,0.0005622949,0.0003986565,0.0004491116,0.0004732368,0.0005806437,0.0007660135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006804019,"about_ca_system_score_gemma":0.001243235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831939,"about_ca_topic_score_gemma":0.002159573,"domain_scores_codex":[0.9995754,0.00007896033,0.00002510846,0.00003377051,0.0002320859,0.00005461864],"domain_scores_gemma":[0.9993093,0.0001809593,0.00006876343,0.0001548812,0.0002559368,0.00003025226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008508919,0.0001577237,0.002425207,0.0003770495,0.00006110509,0.0007554929,0.0001927606,0.1338186,0.1854176,0.1172484,0.02166766,0.5370274],"study_design_scores_gemma":[0.0001095965,0.0003385293,0.0009193632,0.00004925779,0.00002607874,0.0006025925,0.00001655255,0.6974043,0.2592119,0.01267422,0.02860417,0.00004343189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06961058,0.0005912847,0.9100993,0.0002341052,0.0001605416,0.0002446007,0.000517118,0.002811478,0.01573107],"genre_scores_gemma":[0.535001,0.0004444529,0.4466475,0.0001483088,0.00008739803,0.0002155694,0.001782457,0.0002228629,0.01545037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002076107,"threshold_uncertainty_score":0.006945312,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Anwar Haque","is_ca":true},{"name":"Pin‐Han Ho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01102460155833289,"gpt":0.2048898243562108,"spread":0.1938652227978779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005701247,0.0004011568,0.0003506042,0.0002237916,0.0003674046,0.000610503,0.001056603,0.0005623697,0.002108002],"category_scores_gemma":[0.0004403661,0.000141802,0.0003211091,0.0004294153,0.0005740503,0.001294667,0.0008555684,0.0007148938,0.0002666898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006663472,"about_ca_system_score_gemma":0.001119397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262572,"about_ca_topic_score_gemma":0.00180024,"domain_scores_codex":[0.9996978,0.00007420809,0.000008834066,0.00005311461,0.0001090743,0.00005709005],"domain_scores_gemma":[0.9998604,0.00003418625,0.00002337377,0.00003502056,0.00003330092,0.00001376039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001568718,0.0001614916,0.0006012915,0.0002431207,0.00005848972,0.0002951837,0.0001206712,0.5436049,0.0266632,0.09793708,0.01018614,0.3199716],"study_design_scores_gemma":[0.00003398176,0.0001334077,0.0001986842,0.00001015223,0.0000112299,0.0001264583,0.00003610257,0.9557773,0.009767376,0.02568631,0.008207286,0.00001173828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02994947,0.0002455967,0.9628372,0.00037751,0.00004966859,0.00008652564,0.00008014082,0.0004631231,0.005910939],"genre_scores_gemma":[0.7106388,0.0003802496,0.2818511,0.000121302,0.00008295674,0.0001503402,0.0002573245,0.0001027483,0.006415271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002108002,"threshold_uncertainty_score":0.007052004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jelena Mišić","is_ca":true},{"name":"Carol Fung","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02679933560933868,"gpt":0.2456220037888857,"spread":0.2188226681795471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002613327,0.0005734685,0.000723697,0.0004672349,0.0005398183,0.0008124788,0.001618709,0.001018126,0.001654616],"category_scores_gemma":[0.006722391,0.0003141437,0.0006068451,0.0007812351,0.0009901969,0.002158501,0.001260771,0.0006350082,0.0001892341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141926,"about_ca_system_score_gemma":0.0006891234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00191144,"about_ca_topic_score_gemma":0.002115421,"domain_scores_codex":[0.9991308,0.0004234721,0.00002783533,0.0001296307,0.0001788465,0.0001093488],"domain_scores_gemma":[0.9978564,0.001472728,0.0002017296,0.0001452246,0.0002245282,0.00009924827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008128305,0.00003944477,0.0017819,0.00009897897,0.00003235773,0.0001214749,0.0001220541,0.9392992,0.00294345,0.02843425,0.001107925,0.02593769],"study_design_scores_gemma":[0.000006833531,0.00005621541,0.0002818574,0.00000731102,0.000009532458,0.00003618901,0.00002320054,0.9922749,0.0007552648,0.005747105,0.000795418,0.00000607061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1251388,0.0009021572,0.867979,0.0005585144,0.0001020963,0.00007707854,0.00007415315,0.0003161154,0.004852147],"genre_scores_gemma":[0.8797345,0.001127283,0.1140991,0.0001637786,0.000120174,0.0001744511,0.000115732,0.000116882,0.00434801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002613327,"threshold_uncertainty_score":0.01382071,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Niranjayan","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006992885321791408,"gpt":0.2050454258952778,"spread":0.1980525405734864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005455646,0.001827575,0.001162998,0.001499262,0.0008332839,0.002216341,0.00165359,0.002432088,0.004053791],"category_scores_gemma":[0.01725692,0.0007376535,0.001011959,0.002859201,0.003356417,0.003380305,0.001846832,0.003591375,0.001830298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846259,"about_ca_system_score_gemma":0.001880341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003538766,"about_ca_topic_score_gemma":0.002997043,"domain_scores_codex":[0.9963512,0.001351573,0.0001169878,0.0003465262,0.001600969,0.0002326719],"domain_scores_gemma":[0.9908451,0.005346651,0.0005249936,0.0009711509,0.002146622,0.0001653462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004641141,0.00008075685,0.002359962,0.0003650293,0.000140206,0.0006849964,0.0002273354,0.2550455,0.007158851,0.6224038,0.01606516,0.09500439],"study_design_scores_gemma":[0.00002305784,0.0002254344,0.0008824482,0.0001711578,0.00006258458,0.001006719,0.00003231831,0.8598319,0.006694387,0.1150886,0.01590466,0.00007676042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005697389,0.002492604,0.9763467,0.000474188,0.0004060024,0.00005229606,0.00008969718,0.0002345057,0.01420662],"genre_scores_gemma":[0.498761,0.00994001,0.4426498,0.002327682,0.003193222,0.0003374129,0.000565522,0.001023788,0.04120155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005455646,"threshold_uncertainty_score":0.02885252,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Humphrey Rutagemwa","is_ca":true},{"name":"Veluppillai Mahinthan","is_ca":true},{"name":"J.W. Mark","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01704326579859825,"gpt":0.2563443368014892,"spread":0.2393010710028909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168764,0.0009439195,0.0007497362,0.0008737589,0.0003810492,0.001531237,0.0006779426,0.0007135348,0.001288222],"category_scores_gemma":[0.004911841,0.000306477,0.0005188563,0.001714483,0.0007962301,0.001276991,0.0007912642,0.0008024544,0.0006888404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000747837,"about_ca_system_score_gemma":0.001015132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001070298,"about_ca_topic_score_gemma":0.001264866,"domain_scores_codex":[0.9987179,0.0003723327,0.00004477076,0.0000944798,0.0005948248,0.0001757382],"domain_scores_gemma":[0.9982741,0.0008010481,0.0002994955,0.0002546429,0.0003149975,0.00005570194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002334506,0.00007113331,0.003130091,0.0002664484,0.0001219249,0.001246231,0.000292469,0.619243,0.02548096,0.2774376,0.00335552,0.06912126],"study_design_scores_gemma":[0.0000132736,0.0001049578,0.00124071,0.00002237299,0.00002902759,0.0008073927,0.00003861613,0.9395493,0.009397261,0.04540831,0.003328087,0.00006076758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05221866,0.0007965892,0.9358368,0.0001813179,0.000067085,0.0000564015,0.0001343929,0.0004330229,0.01027571],"genre_scores_gemma":[0.8966849,0.001035941,0.09774148,0.0001726051,0.0001362475,0.00009358361,0.0003162389,0.000105526,0.003713436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00168764,"threshold_uncertainty_score":0.008925259,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xiaojiang Du","is_ca":false},{"name":"Yang Xiao","is_ca":false},{"name":"Sghaier Guizani","is_ca":true},{"name":"Hsiao‐Hwa Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008986656461933522,"gpt":0.2272632712244206,"spread":0.218276614762487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249705,0.0004822316,0.0006844955,0.0007466915,0.0008994468,0.000753289,0.002208969,0.0006281775,0.002640556],"category_scores_gemma":[0.002163248,0.0002076064,0.0003407147,0.001043269,0.0005865478,0.002421742,0.002602762,0.000803526,0.00119778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001308352,"about_ca_system_score_gemma":0.001743929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006049679,"about_ca_topic_score_gemma":0.001238882,"domain_scores_codex":[0.999178,0.0002026455,0.00008139263,0.00008309324,0.0003332083,0.0001217454],"domain_scores_gemma":[0.9989807,0.0001488157,0.0001492909,0.0003525935,0.0002872169,0.00008127712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002318145,0.000380898,0.001438376,0.0008693327,0.0001414744,0.000469217,0.0004108078,0.08992352,0.1605063,0.2092476,0.02994778,0.5043464],"study_design_scores_gemma":[0.0003495621,0.0007451195,0.001179724,0.00007029189,0.00009127801,0.0009934291,0.000151092,0.7507681,0.1040932,0.06350751,0.07788555,0.0001650623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06432238,0.001790698,0.903443,0.0007396349,0.0004284059,0.0007819157,0.0006635862,0.003368293,0.02446198],"genre_scores_gemma":[0.7963282,0.0005717334,0.1878326,0.0003094964,0.00007969244,0.0005119031,0.001265457,0.0001061586,0.01299466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002640556,"threshold_uncertainty_score":0.009492815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Amir Ali Basri","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00805228373916755,"gpt":0.2251517901705547,"spread":0.2170995064313871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795254,0.0005493281,0.0008301997,0.0007378029,0.0003078466,0.001181335,0.000587314,0.0009481474,0.001258217],"category_scores_gemma":[0.005838643,0.0002990208,0.0002382474,0.000611463,0.00103307,0.0009530049,0.001049593,0.0003945989,0.0003460444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000565134,"about_ca_system_score_gemma":0.001282633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000724736,"about_ca_topic_score_gemma":0.001312916,"domain_scores_codex":[0.9985248,0.0004145232,0.0001123282,0.0001549001,0.0005874535,0.0002059441],"domain_scores_gemma":[0.9980454,0.001068036,0.0002739477,0.0001739968,0.0003543301,0.00008416799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003015313,0.0001540314,0.01053796,0.0006033152,0.0002056341,0.0009482633,0.000361931,0.4319168,0.1736217,0.1105612,0.004323857,0.26375],"study_design_scores_gemma":[0.00006873983,0.0002877872,0.001756792,0.00004303438,0.00002648721,0.0008855428,0.00004108916,0.904151,0.07043132,0.02023124,0.002028788,0.00004828179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2206909,0.001293791,0.7687299,0.0005370403,0.0000892833,0.0001027482,0.0002389103,0.0004440483,0.007873362],"genre_scores_gemma":[0.854044,0.0003505999,0.1434525,0.0001007045,0.00005115891,0.00004135348,0.0001406604,0.00002942062,0.001789752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001795254,"threshold_uncertainty_score":0.009494305,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Rajibul Islam","is_ca":true},{"name":"Walaa Hamouda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02444884634170552,"gpt":0.2521722302363591,"spread":0.2277233838946536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001846751,0.0006799243,0.000509049,0.0005958612,0.0003466405,0.0005509935,0.0005006092,0.0005558017,0.0007758593],"category_scores_gemma":[0.004205511,0.0001515362,0.0002457675,0.0008159649,0.0005352555,0.0007056692,0.0004793429,0.0003924254,0.0002510707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000736377,"about_ca_system_score_gemma":0.0004500377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147331,"about_ca_topic_score_gemma":0.0008888511,"domain_scores_codex":[0.9989789,0.0003203418,0.00004502097,0.0001031055,0.0004332415,0.0001194433],"domain_scores_gemma":[0.9977298,0.001201157,0.0002366558,0.0002429813,0.0005330209,0.00005638947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00116804,0.0002807003,0.007568412,0.0003864738,0.0001952242,0.0005179833,0.0003565812,0.8030239,0.07723118,0.009162729,0.003043958,0.09706471],"study_design_scores_gemma":[0.00002688665,0.0009851998,0.004104408,0.00002627572,0.00004567959,0.0003545909,0.00006923563,0.9533358,0.03693199,0.002684053,0.00140064,0.00003527951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7968027,0.00327538,0.1879828,0.0003875998,0.0001317007,0.00006143933,0.000268665,0.001022436,0.01006734],"genre_scores_gemma":[0.991979,0.0003553605,0.00673449,0.00001766796,0.00001704088,0.00002106424,0.0001287161,0.00003862775,0.0007081184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001846751,"threshold_uncertainty_score":0.009766638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"T.X. Lai","is_ca":true},{"name":"Siva D. Muruganathan","is_ca":true},{"name":"A.B. Sesay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01652059018640378,"gpt":0.2632228287976637,"spread":0.2467022386112599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113549,0.0006700251,0.0006660295,0.0003195544,0.0003618263,0.0007182256,0.0006700944,0.0008433087,0.001222866],"category_scores_gemma":[0.002285755,0.0002818663,0.0004869277,0.0004775089,0.0005466994,0.0005686379,0.000613628,0.0008200469,0.0009275047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003937621,"about_ca_system_score_gemma":0.001064732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009179775,"about_ca_topic_score_gemma":0.001709078,"domain_scores_codex":[0.9991442,0.0002554856,0.0000383935,0.00006796994,0.0004243441,0.00006964083],"domain_scores_gemma":[0.9987418,0.0004012444,0.0001623488,0.0001708482,0.0004708081,0.00005300464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000485253,0.0001370327,0.0026208,0.0003195377,0.0002043008,0.0004846083,0.0002859317,0.6250154,0.1363043,0.0393682,0.003572707,0.1912021],"study_design_scores_gemma":[0.00001803565,0.0002883005,0.0002430773,0.00001368363,0.00002687832,0.0003742341,0.00001188476,0.9654769,0.02990917,0.001063617,0.002547539,0.00002664695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01394978,0.0002305395,0.9836098,0.00005991929,0.00002620073,0.00004706457,0.00002542781,0.0002709433,0.001780376],"genre_scores_gemma":[0.3201116,0.0003572205,0.6763547,0.0001004865,0.00006911918,0.00006393577,0.0001130523,0.00005110614,0.00277881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001222866,"threshold_uncertainty_score":0.005889058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}