{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142746,0.0001435578,0.0001601342,0.00003440103,0.0001643396,0.000280236,0.0002938747,0.0001274774,0.00001234115],"category_scores_gemma":[0.00001882736,0.000139166,0.00005609511,0.0001724864,0.00003295363,0.0004134687,0.00005287982,0.0001038556,0.00001599577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003268969,"about_ca_system_score_gemma":0.00004335312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001761992,"about_ca_topic_score_gemma":0.00007917708,"domain_scores_codex":[0.9989111,0.00003963318,0.0002308106,0.0003444293,0.0001721854,0.000301865],"domain_scores_gemma":[0.9992101,0.0002471757,0.000120793,0.0002779263,0.00007958253,0.00006437607],"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.0001795601,0.00033634,0.004362505,0.0001984513,0.00006476451,0.00002146819,0.001601863,0.08596311,0.001535706,0.1892822,0.04159657,0.6748575],"study_design_scores_gemma":[0.001191817,0.0002754087,0.008472971,0.00007962339,0.00001194433,0.00001355052,0.0000299425,0.927363,0.001439792,0.03008102,0.0306553,0.0003856792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04619729,0.0001223132,0.9495425,0.0009255321,0.000300591,0.002403674,0.00001391959,0.0001447819,0.0003493865],"genre_scores_gemma":[0.7457101,0.00001065576,0.251491,0.000452402,0.0005824348,0.001391863,0.00001692305,0.00001630092,0.0003282524],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8413998,"threshold_uncertainty_score":0.5675024,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003786761,0.0001537954,0.0001817855,0.000129564,0.00012827,0.0003697673,0.000635619,0.00006202914,0.00006884916],"category_scores_gemma":[0.00002068236,0.0001479622,0.0001355914,0.0003298314,0.00002623459,0.0003256183,0.0001388979,0.0002015583,0.00016409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008321288,"about_ca_system_score_gemma":0.00002147731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003764427,"about_ca_topic_score_gemma":0.000427967,"domain_scores_codex":[0.9985534,0.00009496763,0.000409881,0.0004072543,0.0002485762,0.0002859428],"domain_scores_gemma":[0.9994588,0.00003361741,0.0001914451,0.0001996529,0.00007080091,0.00004563892],"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.000009552646,0.0002577869,0.003519304,0.00003188341,0.00009973971,0.00005892316,0.001459119,0.6296059,0.002006378,0.3228513,0.002753315,0.03734685],"study_design_scores_gemma":[0.0001331176,0.00001694571,0.0007090103,0.00001588516,0.00001495796,0.0000232882,0.00002021552,0.9941339,0.0003543381,0.00003361639,0.004379265,0.0001654019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.438877,0.0001997388,0.5598423,0.00009645935,0.0002740681,0.00004550978,7.923471e-7,0.0001910592,0.0004730909],"genre_scores_gemma":[0.9923888,0.000002382227,0.005857526,0.00006060069,0.000155861,0.000002044436,0.00002441155,0.00001128112,0.001497124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5539848,"threshold_uncertainty_score":0.6033725,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001041895,0.0002599295,0.0003189986,0.00006843193,0.00005818092,0.00005367286,0.000185074,0.0001828304,0.00005848366],"category_scores_gemma":[0.00001303986,0.0002732769,0.00008328145,0.0005587356,0.0001201262,0.0002069493,0.00003960553,0.0001615173,0.000006002929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140774,"about_ca_system_score_gemma":0.00001118061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001628043,"about_ca_topic_score_gemma":0.000003654807,"domain_scores_codex":[0.998624,0.00004274828,0.000476135,0.0002636241,0.0001895481,0.0004039351],"domain_scores_gemma":[0.9992787,0.00006004595,0.0001249246,0.0003537813,0.000121211,0.0000613262],"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.00002137032,0.00005182023,0.001729393,0.0000602692,0.00002219564,0.000002144818,0.00002103724,0.9949713,0.00007927346,0.002186972,0.0004078635,0.0004463169],"study_design_scores_gemma":[0.0005314656,0.00001359793,0.001395889,0.00003208147,0.00002374512,0.000007423576,0.00001650878,0.996861,0.0004510968,0.0002411071,0.0001524217,0.0002736758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04456742,0.0003770996,0.9515205,0.000008660206,0.0002332045,0.0002790155,0.00006296299,0.0004665314,0.002484599],"genre_scores_gemma":[0.9597121,0.0001385943,0.03892887,0.00001072258,0.0002197311,0.00003162384,0.0008237888,0.00007712655,0.00005745145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9151447,"threshold_uncertainty_score":0.9999719,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004285549,0.0002821852,0.0003526671,0.00009441036,0.00009150604,0.0006272182,0.001384909,0.0001836463,0.00003660126],"category_scores_gemma":[0.00000858513,0.0002459903,0.00008882457,0.0007672464,0.0001468563,0.0005695852,0.0004090974,0.0002890226,0.00002154093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101584,"about_ca_system_score_gemma":0.00008575045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002358862,"about_ca_topic_score_gemma":0.0001872924,"domain_scores_codex":[0.9976921,0.0002822561,0.0004540206,0.0006737831,0.0002984937,0.0005993237],"domain_scores_gemma":[0.9989336,0.000121038,0.0001187905,0.0006224875,0.00009307602,0.0001110107],"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.00008157378,0.0006087906,0.005366945,0.00003656881,0.00002619966,0.00007891927,0.0003115685,0.4493381,0.00004233192,0.4860997,0.002318126,0.05569119],"study_design_scores_gemma":[0.0007759111,0.0000865083,0.002786916,0.0000570524,0.000004472699,0.00003590924,0.000007137251,0.9857227,0.0003129238,0.008805218,0.001034855,0.0003704349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03487241,0.000225328,0.9549493,0.00047603,0.0002227702,0.003065622,0.000003119959,0.0001793566,0.006006115],"genre_scores_gemma":[0.9923729,0.00002098585,0.004988068,0.0004502055,0.0003681807,0.001677212,0.00002687955,0.00002075677,0.00007482687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9575005,"threshold_uncertainty_score":0.9999992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000432188,0.0002349049,0.0003039132,0.0000388285,0.0001759394,0.0001481605,0.0006610011,0.0002033591,0.00001573451],"category_scores_gemma":[0.00001223426,0.0002108117,0.000070834,0.0001410621,0.000111171,0.0001749652,0.0004088465,0.0001770254,0.00001207311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008396089,"about_ca_system_score_gemma":0.00002638989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006830705,"about_ca_topic_score_gemma":0.0000551979,"domain_scores_codex":[0.9981768,0.0001561465,0.0003207712,0.0006209948,0.0001346575,0.0005906422],"domain_scores_gemma":[0.9989592,0.0003111257,0.0001151195,0.0004370477,0.00005410759,0.0001234156],"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.0002103085,0.001033742,0.001355459,0.00005394335,0.0001392318,0.00009821792,0.000463507,0.4885002,0.0006610751,0.2866628,0.1062605,0.114561],"study_design_scores_gemma":[0.0008397174,0.0002334068,0.0007696225,0.00001590692,0.000009653099,0.00003184894,0.00001442269,0.9903214,0.0004861943,0.005241327,0.001783397,0.000253087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002452923,0.0005178884,0.9947415,0.0005589803,0.0007309607,0.0007002362,0.00000238035,0.0001754307,0.0001196891],"genre_scores_gemma":[0.8852859,0.00003492995,0.1135527,0.0003809049,0.0002301627,0.0001580798,0.000004651795,0.00001532269,0.0003373396],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8828329,"threshold_uncertainty_score":0.8596653,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003213873,0.0002378785,0.0002613645,0.0001982377,0.0001564999,0.0002356488,0.0003803398,0.0001501503,0.000002226049],"category_scores_gemma":[0.00001981487,0.0002486521,0.00009418359,0.0007148356,0.00003259618,0.0007238269,0.0001638936,0.0001766417,0.00001757323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002411878,"about_ca_system_score_gemma":0.00004330557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004276319,"about_ca_topic_score_gemma":0.0003577451,"domain_scores_codex":[0.9980441,0.00007836925,0.0005628004,0.0003595061,0.0003090372,0.0006461673],"domain_scores_gemma":[0.9988814,0.0001882653,0.0002096077,0.0005042451,0.0001381094,0.00007838907],"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.00002660752,0.00007033326,0.001670887,0.00001399415,0.000008004795,0.0000153954,0.00009446252,0.922592,0.00008471116,0.03436845,0.001827081,0.03922809],"study_design_scores_gemma":[0.001085567,0.00004101702,0.003872016,0.00005279433,0.00000478889,0.00001564157,0.00001497651,0.9798473,0.0005633708,0.0001905345,0.01401438,0.0002976602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.176032,0.00004078307,0.8210738,0.0002490799,0.0008504543,0.0003674621,0.000005078457,0.00026434,0.001116989],"genre_scores_gemma":[0.9642145,0.00001361437,0.03483667,0.0005276986,0.0001956648,0.00001629595,0.00008598732,0.00001801154,0.00009153874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7881825,"threshold_uncertainty_score":0.9999965,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004250467,0.0001125407,0.0001616259,0.0001825879,0.0001563519,0.00006036654,0.0009673334,0.00003852045,0.00003002453],"category_scores_gemma":[0.00003058118,0.00008039462,0.00003789086,0.001807612,0.00005365226,0.0001807287,0.0002508853,0.0001993614,0.00003545836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000584181,"about_ca_system_score_gemma":0.00003572243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003209333,"about_ca_topic_score_gemma":0.00007708164,"domain_scores_codex":[0.9989877,0.0001911665,0.0002599627,0.0001987561,0.0001729933,0.0001894742],"domain_scores_gemma":[0.9988934,0.0002619507,0.00009517426,0.0006193066,0.0001077321,0.00002247484],"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.00003627893,0.0005022281,0.01777923,0.00001669003,0.0000227466,0.000006840194,0.001494334,0.01788206,0.001561971,0.7727929,0.014366,0.1735388],"study_design_scores_gemma":[0.0008255937,0.0003295108,0.08929162,0.0001747534,0.000003433034,0.000005407692,0.00005238457,0.8760598,0.0229444,0.0003153311,0.009632675,0.0003650484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9628316,0.0004405875,0.009198644,0.003705703,0.0002886219,0.0003004814,0.000002106873,0.00006165817,0.02317058],"genre_scores_gemma":[0.9984375,0.0002108017,0.0003905512,0.0003558443,0.00003527091,0.00003210289,0.000002804244,0.00000487828,0.0005302607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8581778,"threshold_uncertainty_score":0.3278398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001368088,0.0001175909,0.0002262455,0.0003325512,0.00003395591,0.00001017819,0.00007557061,0.0001061717,0.00007408217],"category_scores_gemma":[0.00001740703,0.0001313593,0.00005650417,0.001957942,0.00001356398,0.0002230811,0.00001249921,0.0001123672,0.000001827588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001978382,"about_ca_system_score_gemma":0.00001128047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001169423,"about_ca_topic_score_gemma":0.0005765872,"domain_scores_codex":[0.9991555,0.00002506959,0.0003466502,0.0001513991,0.0001308951,0.0001905045],"domain_scores_gemma":[0.999581,0.00004628749,0.00008389456,0.0001995012,0.00006018706,0.00002913142],"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.00002204228,0.00002069174,0.08135906,0.0000234075,0.00002291589,3.930776e-7,0.000005806827,0.915617,0.0003291814,0.00005213125,0.000266295,0.002281098],"study_design_scores_gemma":[0.0003185296,0.00001439709,0.0937604,0.00005021752,0.00003918959,1.436382e-7,0.000006025456,0.9045495,0.0008077676,0.00002372093,0.0003151645,0.000114941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5555498,0.0001636926,0.4433541,0.00001832212,0.0000887754,0.0000938743,0.000002714255,0.0001115806,0.0006171862],"genre_scores_gemma":[0.9919442,0.00007630178,0.007523115,0.00001589845,0.00005943064,0.00001588139,0.0003148641,0.00001908902,0.00003124397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4363944,"threshold_uncertainty_score":0.5356675,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004177192,0.00008972984,0.0001260629,0.00006242714,0.0000376738,0.000009942748,0.00009346159,0.00003806477,0.00003261244],"category_scores_gemma":[0.00001319314,0.00008914989,0.00002487188,0.000115225,0.00003263408,0.00009977112,0.00001388361,0.00004642003,0.000002658145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009400822,"about_ca_system_score_gemma":0.00001719487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002724622,"about_ca_topic_score_gemma":0.00006812614,"domain_scores_codex":[0.9993829,0.00004347863,0.0002229888,0.00008924004,0.0001543814,0.000107026],"domain_scores_gemma":[0.9993517,0.00007270562,0.00008733923,0.0002812776,0.0001921607,0.00001475465],"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.0001205134,0.0001444788,0.006957575,0.0003155452,0.0001244901,4.855508e-7,0.0003396197,0.8045229,0.05531809,0.01441791,0.01086459,0.1068738],"study_design_scores_gemma":[0.002843115,0.0001808352,0.009768963,0.0002499636,0.0001410188,0.000002909411,0.0002023952,0.7307785,0.2271174,0.01573701,0.01252377,0.0004541415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6442046,0.000602818,0.3277568,0.0001474555,0.0001087559,0.001487343,0.00004540437,0.0006673848,0.02497941],"genre_scores_gemma":[0.9773965,0.0000241581,0.02234359,0.000009239697,0.00001525298,0.0000700116,0.0001007114,0.00002136941,0.0000190937],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3331919,"threshold_uncertainty_score":0.3635427,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002671518,0.0001443824,0.0001817935,0.0001522678,0.00006839918,0.00005081193,0.0001087586,0.000120703,0.00000999982],"category_scores_gemma":[0.00001131395,0.0001711406,0.00004218515,0.0002778003,0.00002178749,0.0004033165,0.00001119485,0.0001192549,0.00001762991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000229183,"about_ca_system_score_gemma":0.00001488815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001089262,"about_ca_topic_score_gemma":0.00008722728,"domain_scores_codex":[0.9989418,0.00003557769,0.000370282,0.0002272754,0.0001493699,0.0002757062],"domain_scores_gemma":[0.9995815,0.00002075153,0.00005337104,0.0002265722,0.00007022018,0.00004762849],"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.00004496682,0.0001392991,0.0005454134,0.0001337978,0.00003743632,0.000005252669,0.0002393295,0.9225689,0.02102886,0.003094239,0.01394609,0.0382164],"study_design_scores_gemma":[0.0007084492,0.00007347265,0.006504695,0.00007883822,0.00001395111,0.00003023523,0.0004957844,0.9698173,0.00694945,0.001238819,0.01376611,0.0003228564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7209185,0.0008722168,0.2683238,0.0001213957,0.004306683,0.0009693735,0.00007721494,0.0007995678,0.003611239],"genre_scores_gemma":[0.9692358,0.00001948855,0.02852119,0.000005190799,0.001424976,0.0001988443,0.0001492313,0.00005407924,0.0003912495],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2483173,"threshold_uncertainty_score":0.6978909,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983101,0.0002188525,0.0003814648,0.0001915051,0.00009488409,0.0002874712,0.0007213815,0.0001350418,0.00002388613],"category_scores_gemma":[0.000004953717,0.0002183899,0.0001069087,0.001861236,0.00007108702,0.0003936769,0.0002883485,0.0002378384,0.00002522627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009818244,"about_ca_system_score_gemma":0.00003349096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002120384,"about_ca_topic_score_gemma":0.006545112,"domain_scores_codex":[0.9981203,0.0001014483,0.000367349,0.0006048219,0.0002918435,0.0005142084],"domain_scores_gemma":[0.9988806,0.00008422497,0.000124246,0.000752059,0.00005741591,0.0001014503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003716246,0.0002920756,0.6501243,0.00002679246,0.0002418056,0.0002264725,0.0002807509,0.1202397,0.00004515311,0.005450285,0.02075564,0.2022799],"study_design_scores_gemma":[0.0004790636,0.00003242201,0.3502396,0.00003107919,0.00004768417,0.00001045637,0.000009711444,0.6401483,0.0000129492,0.000429828,0.008259449,0.0002993598],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5913818,0.004860363,0.4000034,0.0004677055,0.0003770522,0.0002782708,0.000006108315,0.0002166864,0.002408603],"genre_scores_gemma":[0.9963286,0.0002131136,0.002669904,0.0002922081,0.0001250667,0.00002480442,0.00001517529,0.00001204142,0.0003191069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5199087,"threshold_uncertainty_score":0.8905684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033482,0.0002107576,0.0002453657,0.0001621826,0.0001367967,0.0001577937,0.0004989187,0.000155672,0.00001060387],"category_scores_gemma":[0.000004757085,0.000227976,0.00008272225,0.0005825622,0.00003328241,0.0004274822,0.000233852,0.0001833541,0.00001598781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000382438,"about_ca_system_score_gemma":0.00006466338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238686,"about_ca_topic_score_gemma":0.001853373,"domain_scores_codex":[0.998144,0.00007533968,0.0004117151,0.0005353107,0.0002164404,0.0006172235],"domain_scores_gemma":[0.9992384,0.00008518522,0.0001142011,0.0004284199,0.00006207727,0.0000717635],"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.00004740464,0.0002370982,0.001103236,0.0000582367,0.00002078162,0.00005659843,0.0001447422,0.1066088,0.0004549556,0.002564561,0.007634947,0.8810686],"study_design_scores_gemma":[0.0009538793,0.00008022694,0.001397279,0.00004826111,0.0000060441,0.00008094733,0.000006749378,0.9875594,0.0005462698,0.00194337,0.00712445,0.0002531093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01269509,0.0001848888,0.9843764,0.0001733433,0.001422972,0.0005736437,0.000003587008,0.0001870234,0.0003830398],"genre_scores_gemma":[0.5579807,0.000007881847,0.4399074,0.0004035301,0.001326442,0.0001139721,0.0000252148,0.00003812046,0.0001967491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8809506,"threshold_uncertainty_score":0.9296592,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009944492,0.0003502225,0.0004666526,0.0001222673,0.0001870212,0.0004077813,0.00215699,0.0002328865,0.00004615063],"category_scores_gemma":[0.00001738873,0.0003521059,0.00009197579,0.0009861082,0.00007648089,0.0008272502,0.001126949,0.0005083474,0.00008584896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009038878,"about_ca_system_score_gemma":0.0001505815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002588897,"about_ca_topic_score_gemma":0.002440911,"domain_scores_codex":[0.9965886,0.0001476011,0.0007970955,0.001007728,0.0003659615,0.001093023],"domain_scores_gemma":[0.9977051,0.0001478629,0.000313728,0.001606946,0.00006370757,0.0001626437],"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.00008768723,0.0006319053,0.01423178,0.00009862873,0.00004606165,0.0007150061,0.0002699109,0.03480266,0.0001563356,0.007630993,0.04077348,0.9005556],"study_design_scores_gemma":[0.001270024,0.00008817502,0.0100137,0.0001609438,0.000007304067,0.00007040494,0.00003867245,0.9608021,0.00005298542,0.0004521619,0.02644428,0.0005992427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.780299,0.002658285,0.2063726,0.002119655,0.001051366,0.0053899,0.00004869349,0.0007927241,0.001267811],"genre_scores_gemma":[0.9756638,0.000069703,0.02188876,0.0004247261,0.0007920552,0.0006140691,0.0001779067,0.0000430891,0.0003259368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9259995,"threshold_uncertainty_score":0.9998931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004792549,0.0001982271,0.0003072291,0.0001831178,0.0001482329,0.0001102633,0.001036877,0.00008860722,0.00003770705],"category_scores_gemma":[0.0000813627,0.0002061923,0.0001302068,0.0004719805,0.00008322316,0.0004444697,0.0003833371,0.0001633734,0.00002026926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001185132,"about_ca_system_score_gemma":0.00005195773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194375,"about_ca_topic_score_gemma":0.0001105514,"domain_scores_codex":[0.9983523,0.0000800796,0.0004126996,0.0004489347,0.0003057059,0.0004002344],"domain_scores_gemma":[0.998748,0.000146389,0.0002573368,0.0006799916,0.0001047605,0.00006349292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005766845,0.0007685424,0.04034304,0.0002686083,0.0001177221,0.00008540756,0.003273535,0.001169142,0.2709716,0.5365826,0.06436612,0.08199597],"study_design_scores_gemma":[0.0008378192,0.0002461589,0.03243226,0.0004044958,0.00002904191,0.0001007682,0.00007215068,0.1346056,0.6791796,0.143603,0.007250192,0.001238964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.573306,0.0001347303,0.4153467,0.0002791974,0.00101067,0.0002004863,0.000006897386,0.0009317448,0.008783601],"genre_scores_gemma":[0.8826319,0.000004225986,0.1169558,0.00007812231,0.0001452542,0.00001032059,0.000003116118,0.0000144136,0.0001568091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.408208,"threshold_uncertainty_score":0.8408278,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004089902,0.0001953755,0.0002435982,0.0001222485,0.0002570312,0.0001944057,0.001084024,0.0001191788,0.00004415181],"category_scores_gemma":[0.00003466525,0.0002005171,0.00007918907,0.000797256,0.00004916186,0.0003165269,0.0005457267,0.0003807097,0.000056097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001567877,"about_ca_system_score_gemma":0.00005371111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005464129,"about_ca_topic_score_gemma":0.005216967,"domain_scores_codex":[0.9982275,0.0002816062,0.0004584638,0.0004202711,0.0001957952,0.0004164005],"domain_scores_gemma":[0.9986346,0.0002045687,0.0001369588,0.000866992,0.00008435795,0.00007254627],"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.00006198224,0.0006497221,0.07110257,0.00001908518,0.00003799543,0.0001358383,0.0008206695,0.1039989,0.002599067,0.1039563,0.0187315,0.6978863],"study_design_scores_gemma":[0.0008161057,0.00002401884,0.1392957,0.00007359032,0.000002367756,0.00001046824,0.00000878753,0.8492877,0.0001641755,0.0001315728,0.009910253,0.0002752453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1093398,0.0009649207,0.8781847,0.001968049,0.0007809967,0.000307091,0.000002177011,0.0003840727,0.008068134],"genre_scores_gemma":[0.9866971,0.0001315539,0.0121907,0.0003271459,0.0001619238,0.00002596855,0.00002573675,0.00001410618,0.0004258014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8773572,"threshold_uncertainty_score":0.8176851,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001196534,0.0001578061,0.0001927627,0.00006793217,0.00007769698,0.00003070618,0.0002094758,0.00008986005,0.00003262771],"category_scores_gemma":[0.00002621123,0.0001804133,0.00006292034,0.0001093172,0.00002933994,0.0001495324,0.00002912587,0.00008913431,0.00004416757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038451,"about_ca_system_score_gemma":0.0000110122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001335906,"about_ca_topic_score_gemma":0.000011192,"domain_scores_codex":[0.999247,0.00002805529,0.0002523647,0.0001465552,0.00009764597,0.0002284173],"domain_scores_gemma":[0.9992972,0.0001467723,0.00005682731,0.0003901628,0.00006775814,0.00004125543],"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.00007277638,0.0002558832,0.000239709,0.00006089316,0.00005379563,0.000002545911,0.00006927496,0.7243807,0.1215376,0.009370649,0.1018532,0.0421029],"study_design_scores_gemma":[0.001161414,0.00007621364,0.0005165204,0.00002917687,0.00001692772,0.000005273882,0.000006073391,0.831653,0.0916692,0.01311425,0.06138802,0.0003639184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03172466,0.0003084263,0.9642227,0.0001672157,0.00006957456,0.000588419,0.0000905299,0.001371468,0.001456973],"genre_scores_gemma":[0.8359277,0.00003016617,0.1631931,0.00002205191,0.00009291927,0.00017275,0.0001218565,0.00004942537,0.000390051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.804203,"threshold_uncertainty_score":0.7357039,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699079,0.0002199585,0.0002879443,0.0000855594,0.0001454535,0.0001698953,0.0008472999,0.000156587,0.000004357637],"category_scores_gemma":[0.00001889651,0.0002408394,0.00009208342,0.0004928162,0.00002440688,0.0003258804,0.0002147406,0.0002041697,0.00001341291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001616512,"about_ca_system_score_gemma":0.00005846291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001375392,"about_ca_topic_score_gemma":0.0007666502,"domain_scores_codex":[0.9980803,0.00005040732,0.0004805904,0.0005940685,0.0002116307,0.0005830439],"domain_scores_gemma":[0.9988567,0.0001674626,0.0002220194,0.0005558194,0.0001256464,0.00007229972],"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.00005778173,0.0003983722,0.0011759,0.00006799387,0.0000214436,0.00001352477,0.0001800412,0.06495424,0.003684347,0.8093647,0.004088485,0.1159931],"study_design_scores_gemma":[0.001466457,0.00004377388,0.003379955,0.00007224588,0.000005865019,0.00000814588,0.000007126419,0.9828145,0.0002207375,0.01083272,0.0008735257,0.0002749808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02884921,0.0002205075,0.9683221,0.0006046914,0.0006148367,0.0007756523,0.000004593394,0.0002137119,0.0003947033],"genre_scores_gemma":[0.8960202,0.00001543176,0.1028263,0.000510507,0.0002533226,0.0002047911,0.00003285955,0.00002402802,0.0001125301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9178602,"threshold_uncertainty_score":0.9821144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007777767,0.00009266745,0.0001613954,0.00006559463,0.00004212682,0.00001142231,0.0005050726,0.00007005463,0.00004896548],"category_scores_gemma":[0.00001148527,0.0000940702,0.00004162564,0.0001157089,0.00004133053,0.0000951684,0.00003480445,0.00007575172,0.00001386204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004618294,"about_ca_system_score_gemma":0.00001326259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004669937,"about_ca_topic_score_gemma":0.00007510843,"domain_scores_codex":[0.9994075,0.000006600778,0.0002425599,0.00008606556,0.00006875953,0.0001885027],"domain_scores_gemma":[0.9993928,0.00006192437,0.00004389313,0.0004367838,0.00004770336,0.00001689643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000261528,0.001249063,0.1202673,0.001803569,0.0008282281,0.000002720979,0.0005461127,0.04807622,0.3635907,0.03659917,0.1422172,0.2845581],"study_design_scores_gemma":[0.002922557,0.0002045657,0.03549731,0.00007865418,0.00008657917,0.000006273278,0.00003616243,0.06170086,0.7150788,0.004810099,0.1790596,0.0005185133],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8801938,0.0008518209,0.105111,0.0006273935,0.0002980759,0.0004865614,0.00003417377,0.0003760135,0.01202108],"genre_scores_gemma":[0.9973179,0.00009248274,0.002177009,0.00003413057,0.00003395864,0.0001722144,0.00002237703,0.0000144388,0.0001355347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3514881,"threshold_uncertainty_score":0.3836071,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002025,0.0001659656,0.0002373245,0.00005468799,0.0001304076,0.0001006082,0.0007442621,0.00007261612,0.00007509653],"category_scores_gemma":[0.00001413815,0.0001680481,0.00006759181,0.0007343603,0.00002447613,0.00028768,0.0001668428,0.00009331279,0.0002269804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006202226,"about_ca_system_score_gemma":0.00008981941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008823853,"about_ca_topic_score_gemma":0.0015155,"domain_scores_codex":[0.9981482,0.0002170212,0.0005045471,0.0004030897,0.0003341143,0.0003930314],"domain_scores_gemma":[0.9987217,0.0001615658,0.0002060419,0.0006166661,0.000193279,0.0001007788],"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.00004843845,0.0001646407,0.002664327,0.00002606213,0.00006239628,0.000003965916,0.0001217936,0.1324158,0.000868635,0.6281521,0.01681931,0.2186525],"study_design_scores_gemma":[0.005678602,0.0004703114,0.3618687,0.0003074088,0.0001122277,0.000013736,0.0001270012,0.3679453,0.001004663,0.1215894,0.1387569,0.002125705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05855669,0.0003257612,0.920802,0.01169142,0.001272853,0.0003588202,0.000005415412,0.000281558,0.006705497],"genre_scores_gemma":[0.9835687,0.000004838355,0.01035202,0.004967943,0.0004033849,0.00002446643,0.00001950184,0.00001023832,0.0006489257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.925012,"threshold_uncertainty_score":0.6852803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000706533,0.0001157034,0.0001107112,0.00005265379,0.00008736463,0.00004087279,0.000193504,0.00003986922,0.00002489253],"category_scores_gemma":[0.000005790984,0.0001070188,0.000043954,0.0001169893,0.0000149132,0.00007081364,0.00002969705,0.00006286075,0.00002248806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040664,"about_ca_system_score_gemma":0.0000114099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005477915,"about_ca_topic_score_gemma":0.0001678598,"domain_scores_codex":[0.9994723,0.000006024498,0.0001392813,0.0001059605,0.00005276289,0.0002237179],"domain_scores_gemma":[0.9995037,0.00003191952,0.00001957942,0.0003638393,0.0000366406,0.00004435525],"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.00007338889,0.0002071742,0.004654713,0.0001751235,0.0001284144,0.000009691018,0.0002100226,0.8563883,0.004409498,0.006528104,0.1021486,0.0250669],"study_design_scores_gemma":[0.002308341,0.0001474884,0.006805307,0.0001089445,0.00007810648,0.00003744845,0.00008816576,0.6950902,0.007090053,0.001519667,0.2857717,0.000954583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5793377,0.002525183,0.3886468,0.0004190031,0.0006603413,0.0006661376,0.0000984678,0.0007721105,0.02687422],"genre_scores_gemma":[0.9696318,0.00004558561,0.02959142,0.00003606189,0.0002056923,0.00007289111,0.00006122794,0.00003682868,0.0003185246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.390294,"threshold_uncertainty_score":0.4364099,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001985531,0.000114354,0.0001484831,0.00004005803,0.0001768428,0.00008808386,0.0005586901,0.00005018229,0.00005075889],"category_scores_gemma":[0.000004879019,0.00008581606,0.00009318802,0.0002023349,0.00005071786,0.0001597064,0.0001351993,0.0001101439,0.00002205345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006482543,"about_ca_system_score_gemma":0.00003099882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003985906,"about_ca_topic_score_gemma":0.0001056729,"domain_scores_codex":[0.9989722,0.00004896906,0.0002219754,0.000228027,0.0002299107,0.0002989486],"domain_scores_gemma":[0.9993914,0.00005898606,0.00009428318,0.0003764821,0.00003658388,0.00004224216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008615234,0.001159254,0.1182025,0.00007999415,0.0001580206,0.0002157632,0.00670351,0.007729903,0.002742387,0.7841325,0.01736562,0.06142442],"study_design_scores_gemma":[0.01354443,0.0006526069,0.7415377,0.0003926943,0.0004466128,0.000359622,0.01058495,0.1313748,0.005780731,0.03391165,0.05798167,0.003432509],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985952,0.000485123,0.6925926,0.001886647,0.0007842736,0.0003144259,0.00001286513,0.0002188743,0.005110024],"genre_scores_gemma":[0.9980987,0.000005110185,0.001176187,0.00009914211,0.00008847794,0.00002303851,0.00000139047,0.000006876416,0.0005010511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7502209,"threshold_uncertainty_score":0.3499478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594994,0.0002588801,0.0002406874,0.0000825069,0.0006632787,0.0004746927,0.001293017,0.0001215088,0.00006549587],"category_scores_gemma":[0.00007018421,0.00017916,0.0001089011,0.00142027,0.0001654333,0.0003021776,0.0006322791,0.0003987182,0.0002656427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123678,"about_ca_system_score_gemma":0.00008039342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003386765,"about_ca_topic_score_gemma":0.0003316343,"domain_scores_codex":[0.9977654,0.0003417397,0.0003582783,0.0005776031,0.0003615892,0.0005953647],"domain_scores_gemma":[0.9986111,0.0001858219,0.000106249,0.0008477403,0.0001203103,0.000128782],"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.00007605748,0.0001423941,0.00008880382,0.00001339153,0.00004257903,0.00001073485,0.001972181,0.09539513,0.0001540199,0.723931,0.09780995,0.08036377],"study_design_scores_gemma":[0.0009809514,0.0005790862,0.00262468,0.0001115876,0.00004002791,0.0001848325,0.0002212536,0.4436896,0.001291303,0.2382412,0.3109566,0.001078863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02290659,0.0006479571,0.9458863,0.00346997,0.001295534,0.000885202,0.00000309005,0.0004055257,0.02449981],"genre_scores_gemma":[0.9733915,0.0000474726,0.02199652,0.003178524,0.0009281086,0.0001122354,0.000005962136,0.00001924658,0.0003203818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.950485,"threshold_uncertainty_score":0.7305931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001586061,0.0002143027,0.0003006182,0.00006664969,0.00009070108,0.00004470789,0.0001693061,0.0001133772,0.000005337673],"category_scores_gemma":[0.00001012575,0.000168627,0.0001076864,0.0001937757,0.00003829694,0.0001853055,0.00001303451,0.0001099992,0.00000733391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008419785,"about_ca_system_score_gemma":0.00002240777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001981166,"about_ca_topic_score_gemma":0.00006087636,"domain_scores_codex":[0.9988406,0.0000123079,0.0005177193,0.0002046247,0.0001369355,0.0002878174],"domain_scores_gemma":[0.999373,0.00005981237,0.0001196731,0.0002486515,0.0001625645,0.00003629488],"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.000005761519,0.00008539358,0.00004177884,0.0004943989,0.00004972519,9.971592e-7,0.0002037238,0.9685331,0.007173339,0.00008651181,0.0004732957,0.02285199],"study_design_scores_gemma":[0.001126586,0.00001719535,0.0001659796,0.0001540383,0.00004322128,0.00001128622,0.000127237,0.9795749,0.002924952,0.000007329677,0.01564315,0.0002041284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009275536,0.002121626,0.9948098,0.0000474175,0.0004930497,0.0009493537,0.0002535679,0.0002212454,0.0001764061],"genre_scores_gemma":[0.329945,0.00005425659,0.6672517,0.0000459037,0.0007810462,0.0003767197,0.0001557802,0.0001815652,0.001208004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3290175,"threshold_uncertainty_score":0.6876407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001677928,0.0001300757,0.0002115519,0.0001172709,0.00004543985,0.00001210286,0.0002067439,0.00008450443,0.0000318224],"category_scores_gemma":[0.00003518112,0.0001502598,0.00005186508,0.000311198,0.00005507928,0.0001869562,0.00006543157,0.0002099609,0.00001401838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001695862,"about_ca_system_score_gemma":0.00002346917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004117769,"about_ca_topic_score_gemma":0.001977049,"domain_scores_codex":[0.9990991,0.00004511446,0.0004066828,0.0001540689,0.00009911016,0.0001959372],"domain_scores_gemma":[0.9992224,0.00006186989,0.00006272477,0.0005706623,0.00005086301,0.00003150387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002182878,0.005317345,0.2779748,0.00129697,0.0001663313,0.000034123,0.002708956,0.2262147,0.2155525,0.01831278,0.008978133,0.2432251],"study_design_scores_gemma":[0.006382906,0.000323468,0.2801299,0.0004417386,0.0000803139,0.00002423491,0.000351172,0.1113106,0.3851257,0.2036808,0.01020677,0.001942422],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7743216,0.0002343346,0.2228415,0.00009666986,0.00007179199,0.0003771819,0.00002451555,0.0005963374,0.001436068],"genre_scores_gemma":[0.9812347,0.00002508918,0.01856942,0.00001114717,0.00002280438,0.00006575913,0.00004177284,0.00001831071,0.00001104208],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2412827,"threshold_uncertainty_score":0.6127415,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002370481,0.0002699199,0.0002937277,0.00009266908,0.0002466619,0.000116064,0.0005060621,0.0001721549,0.000008250283],"category_scores_gemma":[0.000004620398,0.0002591905,0.0001224612,0.0003909721,0.00007074771,0.0001129574,0.00009910961,0.0001194691,0.000005446491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000053505,"about_ca_system_score_gemma":0.00003109347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004618111,"about_ca_topic_score_gemma":0.0001694494,"domain_scores_codex":[0.9979464,0.00002855227,0.0003745391,0.0006920703,0.0002589772,0.0006994989],"domain_scores_gemma":[0.9989144,0.0001257843,0.000114884,0.0006056605,0.0001028003,0.0001364784],"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.00001449882,0.0000949443,0.001002829,0.000008680605,0.00001075272,0.0000170911,0.00002212437,0.914358,0.0001124909,0.07593816,0.004614926,0.003805474],"study_design_scores_gemma":[0.0005878241,0.00005760252,0.002084526,0.00002364211,0.00001375587,0.00002390682,0.000005443687,0.8934284,0.0005297358,0.0002974822,0.1026261,0.0003215784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06748083,0.0008527077,0.9254718,0.0004913431,0.000859872,0.0001331876,0.000006233311,0.000343504,0.004360563],"genre_scores_gemma":[0.9472631,0.00004281201,0.04903067,0.0004924934,0.000392886,0.00004100875,0.0000302191,0.00003351483,0.002673293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8797823,"threshold_uncertainty_score":0.9999861,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001165562,0.00009919565,0.0001297532,0.00004957554,0.00007450964,0.000009805914,0.0001447815,0.00004535321,0.00002464225],"category_scores_gemma":[0.00002587388,0.00008749716,0.00002726319,0.0002757904,0.00001772821,0.0001167915,0.00006918624,0.0001347083,0.00002458914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001363834,"about_ca_system_score_gemma":0.000003812641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000573725,"about_ca_topic_score_gemma":0.0003270016,"domain_scores_codex":[0.9994273,0.00002735126,0.0001833795,0.0001175395,0.00007560233,0.0001687972],"domain_scores_gemma":[0.9996898,0.00007094492,0.00005390701,0.0001323769,0.00003818767,0.00001475601],"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.00002114668,0.00003814311,0.1166568,0.00006883937,0.00002051613,0.000006900614,0.001696751,0.8768122,0.001849317,0.0008430859,0.0009063911,0.001079921],"study_design_scores_gemma":[0.002387707,0.00009717968,0.13293,0.001293079,0.00005261819,0.00005554265,0.003237142,0.8356591,0.0185557,0.004067313,0.0004888849,0.001175736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8867044,0.00006609557,0.09473523,0.00003121816,0.0003826381,0.0001882101,0.00001013831,0.0001491338,0.01773288],"genre_scores_gemma":[0.9991351,0.00001017187,0.0006567604,0.00001098132,0.00004270413,0.00000260074,0.000004557864,0.0000124583,0.0001245998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1124307,"threshold_uncertainty_score":0.3568031,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007664209,0.0002035233,0.0002617011,0.00006397872,0.00005035645,0.00006241962,0.000192151,0.0001814681,0.00006771088],"category_scores_gemma":[0.00003844551,0.000197284,0.00009570353,0.0001820417,0.0001677567,0.00007249285,0.00004591688,0.00021793,0.00005377633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007886019,"about_ca_system_score_gemma":0.00001603565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001149929,"about_ca_topic_score_gemma":0.00002273877,"domain_scores_codex":[0.9989412,0.00001028045,0.0002583222,0.0002181814,0.0001169688,0.0004550315],"domain_scores_gemma":[0.9994693,0.0001885214,0.00002130479,0.0002151949,0.00004689705,0.00005882185],"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.00007952053,0.0004094077,0.0007826703,0.0002387868,0.0004931756,0.0001910907,0.000290165,0.03764528,0.008218443,0.2588239,0.07805859,0.614769],"study_design_scores_gemma":[0.0008918447,0.0000766099,0.0004643041,0.00002122546,0.0000183169,0.00001598765,0.0000275362,0.9615092,0.0008337405,0.01763372,0.01819894,0.0003086247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.193976,0.000733767,0.7904339,0.0007426552,0.0006778816,0.0009687053,0.0002569442,0.00349168,0.008718416],"genre_scores_gemma":[0.7426497,0.00001631574,0.2564294,0.00007924579,0.0003310133,0.0001316904,0.00007910049,0.00004584292,0.0002376013],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238639,"threshold_uncertainty_score":0.8045008,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002052632,0.0002721041,0.0003870665,0.0002291392,0.00008206415,0.00004834156,0.0001574219,0.0002132093,0.000007894332],"category_scores_gemma":[0.00005879263,0.0003120431,0.00007159322,0.0004567094,0.00001403498,0.000334464,0.00001933839,0.0001872875,0.00003208173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005333181,"about_ca_system_score_gemma":0.00002817179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341826,"about_ca_topic_score_gemma":0.0004924948,"domain_scores_codex":[0.9984344,0.00003086436,0.000593254,0.0003254817,0.0001128423,0.0005031851],"domain_scores_gemma":[0.9993998,0.0001042518,0.0001177088,0.0002103702,0.000111736,0.00005611859],"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.000008962728,0.00001888902,0.001316771,0.0001702285,0.00002417679,0.000004995185,0.0002049657,0.9929096,0.004385143,0.0002930014,0.0003849886,0.0002783107],"study_design_scores_gemma":[0.0009513081,0.00003997575,0.0002971852,0.0002941956,0.00001555944,0.000009939472,0.00006298208,0.9936658,0.003544367,0.0004162883,0.0003334155,0.0003690185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05372564,0.0007596393,0.9358034,0.00001436885,0.002554129,0.001632333,0.00005056201,0.0005146439,0.004945352],"genre_scores_gemma":[0.9888634,0.00001677949,0.009953191,0.000005783116,0.0004292844,0.0002789583,0.0001092388,0.00009039699,0.000252958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9351377,"threshold_uncertainty_score":0.9999332,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002797025,0.0001800701,0.0001957221,0.0001004609,0.0008943944,0.0002065919,0.000556245,0.00006963559,0.00001297887],"category_scores_gemma":[0.00001169572,0.0001613019,0.00005231437,0.0004724917,0.00005011641,0.0002475765,0.000564536,0.000196273,0.00001802088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001288183,"about_ca_system_score_gemma":0.00004376828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005475321,"about_ca_topic_score_gemma":0.0001384734,"domain_scores_codex":[0.99875,0.0002691814,0.000172391,0.0003813916,0.0002083488,0.0002187113],"domain_scores_gemma":[0.9990222,0.0001257555,0.00008860381,0.000490108,0.0001936307,0.00007965698],"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.0001218058,0.000193023,0.003082438,0.00003306042,0.0000598622,0.000068688,0.001268555,0.04866073,0.001543352,0.9016061,0.01965956,0.02370277],"study_design_scores_gemma":[0.0009826792,0.0002214173,0.004362343,0.000170037,0.00001528482,0.000007857028,0.0001347967,0.9861137,0.002983014,0.0002317136,0.004335185,0.0004419411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05961826,0.001497628,0.9073792,0.003123738,0.0005077576,0.0004377457,0.00002989253,0.0005621144,0.02684373],"genre_scores_gemma":[0.9913796,0.00001677765,0.00756009,0.0005662924,0.00007937821,0.000008919493,0.00001159687,0.000006667551,0.0003706942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.937453,"threshold_uncertainty_score":0.6879049,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004638121,0.00008920785,0.0001728528,0.00004150654,0.00007183326,0.00002013119,0.00005867793,0.00001795816,0.0002081504],"category_scores_gemma":[0.000002515986,0.00008317056,0.0001456474,0.0001105783,0.00002410689,0.00004030799,0.00001538557,0.00004836279,0.0000122984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001584806,"about_ca_system_score_gemma":0.0000233675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008519769,"about_ca_topic_score_gemma":0.00001032372,"domain_scores_codex":[0.9993818,0.00001145952,0.0002280264,0.0001292351,0.00006801899,0.0001814074],"domain_scores_gemma":[0.9996728,0.00004663424,0.0001049681,0.00008211689,0.00006268545,0.00003077951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003048729,0.002567326,0.5705086,0.0001913343,0.0007568448,0.000002786171,0.0006121343,0.005963838,0.01980241,0.03854939,0.05341941,0.307321],"study_design_scores_gemma":[0.005670874,0.00218029,0.4054892,0.00009158562,0.001044102,0.00001241172,0.001035582,0.433598,0.01020748,0.1135094,0.0257608,0.001400262],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6349561,0.000007102824,0.3638191,0.00009668769,0.00006016693,0.00008014632,0.00009444134,0.00001559076,0.0008706432],"genre_scores_gemma":[0.9979043,1.028742e-7,0.0008809144,0.00001960882,0.0001952009,0.00003247453,0.000616073,0.000007542389,0.0003437813],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4276341,"threshold_uncertainty_score":0.3391597,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002712347,0.0003295355,0.0003042773,0.00007492152,0.000335845,0.0003407442,0.0009506581,0.0002063025,0.00001732061],"category_scores_gemma":[0.00002047952,0.0003141786,0.0002111805,0.0004240117,0.00005017219,0.0001855103,0.0002817977,0.0002077118,0.00002464228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061656,"about_ca_system_score_gemma":0.0000475156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000095847,"about_ca_topic_score_gemma":0.0001082549,"domain_scores_codex":[0.9974695,0.00009673374,0.0004837224,0.0007394128,0.000305998,0.0009045895],"domain_scores_gemma":[0.9984977,0.0001829934,0.000243693,0.0008106317,0.0001405591,0.0001244532],"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.0000234578,0.000115509,0.0003726401,0.00002062879,0.00001425031,0.00003555202,0.00003919528,0.9771161,0.00005986725,0.01300807,0.005009467,0.004185249],"study_design_scores_gemma":[0.001040255,0.0001048747,0.0001253961,0.00005659006,0.000006173438,0.00007210614,0.000003704735,0.9540036,0.001067618,0.0005607455,0.0425658,0.0003931674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002085783,0.00002395284,0.9515357,0.0003496361,0.0004733377,0.04279209,0.000005416895,0.0006883945,0.002045699],"genre_scores_gemma":[0.6435913,0.00000107024,0.194726,0.001177513,0.002602364,0.1560739,0.00003951677,0.0001295184,0.001658798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7568097,"threshold_uncertainty_score":0.999931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636502,0.0002199558,0.0002580255,0.00009715804,0.0002153767,0.0004167952,0.001462601,0.0001203491,0.0001741675],"category_scores_gemma":[0.00002515692,0.000200679,0.0001609512,0.0004946436,0.00003712228,0.0003063906,0.000471765,0.0002662333,0.0002320871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097,"about_ca_system_score_gemma":0.00004085964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001086661,"about_ca_topic_score_gemma":0.0007730211,"domain_scores_codex":[0.9979089,0.0001268238,0.0004631913,0.0004608551,0.0005921572,0.0004480641],"domain_scores_gemma":[0.9985242,0.00006830177,0.0001715086,0.0007737763,0.0003561825,0.0001060397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005124848,0.0006305677,0.001119544,0.00002909459,0.00008779849,0.00003416755,0.001566974,0.2649361,0.00004973746,0.1043617,0.4827803,0.1443527],"study_design_scores_gemma":[0.000316598,0.00008611762,0.001169928,0.00002423176,0.00000794952,0.000006535303,0.00002659618,0.5439866,0.00002880577,0.00006660559,0.4540574,0.0002227225],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02079458,0.0003910872,0.9375542,0.002370585,0.0004173212,0.02475592,0.000007501027,0.0006764465,0.01303233],"genre_scores_gemma":[0.9656043,0.000002193653,0.01635124,0.0007206205,0.0002035427,0.01144829,0.00003325378,0.00002125494,0.005615309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9448097,"threshold_uncertainty_score":0.8183451,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001405021,0.0001317108,0.0001639426,0.0001232823,0.00008538859,0.00003828798,0.0003436541,0.0001719394,0.00001282721],"category_scores_gemma":[0.00002122035,0.0001423876,0.00004796725,0.0002286935,0.00003540673,0.00009478835,0.00002546638,0.00009547389,0.00002708889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001330806,"about_ca_system_score_gemma":0.00001217074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002782197,"about_ca_topic_score_gemma":0.0001823033,"domain_scores_codex":[0.9992471,0.00002373374,0.0002964332,0.0001311388,0.00007403527,0.0002275593],"domain_scores_gemma":[0.999245,0.00006403028,0.0000443733,0.0005687155,0.00005645534,0.00002138908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000595406,0.0001075376,0.002554749,0.0002345247,0.0000666928,0.000002623861,0.000111873,0.002506276,0.07883335,0.8573694,0.04955546,0.008651546],"study_design_scores_gemma":[0.001003955,0.0001716065,0.001325008,0.0001886207,0.00006750006,0.00006399115,0.000315116,0.01881568,0.06195522,0.2727383,0.6421872,0.001167716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04074779,0.003640851,0.8773943,0.0004862856,0.000467918,0.001150946,0.00008902932,0.00517294,0.07084999],"genre_scores_gemma":[0.952315,0.0000648448,0.04667005,0.00002644625,0.00009237868,0.0004483959,0.0001520926,0.0000427008,0.0001881227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9115672,"threshold_uncertainty_score":0.5806399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000148749,0.000203828,0.0003023794,0.0001605739,0.00007028879,0.00007059735,0.0008556255,0.000240258,0.0001130614],"category_scores_gemma":[0.00002359266,0.000225608,0.00006182191,0.0006156833,0.00006835534,0.0001437866,0.00006582568,0.0003923159,0.00004998596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001949818,"about_ca_system_score_gemma":0.0000292336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003596219,"about_ca_topic_score_gemma":0.00124775,"domain_scores_codex":[0.998804,0.00005284345,0.0003867844,0.0001942573,0.0001100088,0.0004520514],"domain_scores_gemma":[0.99898,0.0001862334,0.00005311006,0.000692279,0.0000402948,0.0000480435],"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.00004087216,0.0002278023,0.04217824,0.00004927503,0.00007862427,0.00003348813,0.00001543923,0.914885,0.005426519,0.001930679,0.019144,0.01598999],"study_design_scores_gemma":[0.001842563,0.00001685361,0.02749196,0.00007264878,0.00002587229,0.000007492967,0.00001208428,0.950455,0.002005073,0.0004775976,0.01717719,0.0004156539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4128354,0.0025207,0.5618804,0.005825366,0.0006940971,0.0010587,0.0002186448,0.00387321,0.01109353],"genre_scores_gemma":[0.9990377,0.00002140844,0.0002804134,0.0001357505,0.0000641185,0.0001062843,0.0002877846,0.00003599551,0.00003050924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5862024,"threshold_uncertainty_score":0.9200029,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007626303,0.000131716,0.0002226463,0.0001319713,0.00002644992,0.000006020542,0.0004080131,0.0001325223,0.00001254932],"category_scores_gemma":[0.00000550284,0.0001352987,0.0000330341,0.0003056081,0.00004315556,0.00008661827,0.00002259794,0.0002083053,0.00003827169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009339487,"about_ca_system_score_gemma":0.00001094573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004531951,"about_ca_topic_score_gemma":0.0006131764,"domain_scores_codex":[0.9991962,0.00001949191,0.0003458755,0.0001259361,0.00008528608,0.0002272027],"domain_scores_gemma":[0.9993236,0.00004320088,0.00003810459,0.0005444509,0.00003126435,0.00001934569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00008225583,0.0005307131,0.666424,0.001643237,0.00009668087,0.00001656289,0.0008581398,0.1308531,0.1246608,0.01124817,0.001305195,0.06228112],"study_design_scores_gemma":[0.002236289,0.00007740601,0.5271239,0.0004187701,0.00002273501,0.00002238093,0.0002889832,0.3995698,0.06095732,0.00009944547,0.008594877,0.0005880948],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9897701,0.0004570174,0.001022904,0.00002151013,0.00007036506,0.0001544805,0.00001776875,0.000462707,0.008023174],"genre_scores_gemma":[0.9968855,0.00008222169,0.0028842,0.000005660696,0.000009152515,0.00005311384,0.00001749829,0.00001870989,0.00004392678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2687167,"threshold_uncertainty_score":0.5517322,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009516657,0.0001645498,0.0003325684,0.0001741979,0.00005075614,0.00002563709,0.0001842048,0.00006664718,0.0001164374],"category_scores_gemma":[0.000003262818,0.0001644043,0.0001218303,0.0009715123,0.00002788392,0.000351222,0.00001975125,0.00009293872,0.000005033653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000097605,"about_ca_system_score_gemma":0.00001115851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009148876,"about_ca_topic_score_gemma":0.0001851021,"domain_scores_codex":[0.9989749,0.00002151179,0.0004079199,0.0001702797,0.000177524,0.0002478293],"domain_scores_gemma":[0.9995502,0.00002945336,0.00008498574,0.0002434695,0.0000547283,0.00003715934],"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.00005697196,0.00002463327,0.009919379,0.0001210463,0.00008525481,8.912787e-7,0.00002485765,0.9857197,0.0002343909,0.00004164561,0.0003143705,0.003456797],"study_design_scores_gemma":[0.001533392,0.0000212229,0.01362771,0.00004913209,0.000118139,9.623789e-7,0.000005104787,0.9738042,0.00766548,0.00003559577,0.002914507,0.0002245593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497063,0.00005904614,0.7301901,0.00001335484,0.0001154423,0.01258588,0.0000115743,0.0003276788,0.006990615],"genre_scores_gemma":[0.9892152,0.00001581319,0.003484537,0.000008581081,0.00008524339,0.007060965,0.000034942,0.00002910994,0.00006560449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7395089,"threshold_uncertainty_score":0.6704214,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001974075,0.0001196944,0.0001643364,0.0000554153,0.00003712305,0.00001269676,0.0001287698,0.00006975191,0.00002015663],"category_scores_gemma":[0.00001921158,0.0001018788,0.00004081856,0.0002429236,0.00001892165,0.0001110882,0.00002212193,0.0001390958,0.000007717952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001230148,"about_ca_system_score_gemma":0.000005063053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005582787,"about_ca_topic_score_gemma":0.0001535364,"domain_scores_codex":[0.9992446,0.00002364071,0.0003118844,0.000117097,0.00008257189,0.0002201761],"domain_scores_gemma":[0.9995827,0.00009148446,0.00005884732,0.0002288591,0.00001955803,0.00001851456],"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.000004864964,0.00001052651,0.0007759571,0.00001953281,0.000004743113,0.000001314506,0.0000549968,0.9956818,0.0002235637,0.001031125,0.0002803471,0.001911195],"study_design_scores_gemma":[0.0003527269,0.00002446458,0.002487188,0.000182247,0.000006738284,0.000003498757,0.0001476996,0.9918951,0.001566807,0.0004525443,0.002663694,0.0002173286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2979894,0.002215334,0.6759776,0.00009006835,0.0005982916,0.0005374045,0.00001296897,0.0002975818,0.02228132],"genre_scores_gemma":[0.9939485,0.00005138067,0.005804929,0.00001767163,0.0000684824,0.00001702218,0.00001031509,0.00002436841,0.00005734363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6959591,"threshold_uncertainty_score":0.4154496,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002393727,0.0003471486,0.0004435626,0.0001710491,0.0001832583,0.0001372664,0.0008590197,0.0001563111,0.00001804265],"category_scores_gemma":[0.000002822608,0.0003102506,0.0000720335,0.0006609836,0.0001698211,0.0003405123,0.000122342,0.0001913825,0.000004767481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006414469,"about_ca_system_score_gemma":0.00005566979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000672764,"about_ca_topic_score_gemma":0.002853341,"domain_scores_codex":[0.9973105,0.0002839062,0.0005605294,0.000754564,0.0005043444,0.0005861865],"domain_scores_gemma":[0.9981996,0.000135419,0.0003236267,0.001012395,0.0001772731,0.0001516826],"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.00005046628,0.001193558,0.003940548,0.000006399986,0.00004166847,0.000100986,0.0001805223,0.9705056,0.0001160127,0.006347893,0.0001301315,0.01738622],"study_design_scores_gemma":[0.001850156,0.0008311083,0.008097691,0.00003984569,0.00003576624,0.0001029828,0.0001684664,0.988071,0.000203394,0.00001640578,0.0001416464,0.0004415179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7121498,0.00008542412,0.2866715,0.00002750121,0.0002297175,0.0001731256,0.000002510708,0.0002920154,0.0003684304],"genre_scores_gemma":[0.990633,0.00001167672,0.008950696,0.00006706267,0.000166773,0.00002089096,0.00002633969,0.00003184082,0.00009175307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2784832,"threshold_uncertainty_score":0.999935,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438069,0.0001345227,0.0001482147,0.00005104818,0.0001687004,0.0001571094,0.0004603215,0.00006775289,0.00001916138],"category_scores_gemma":[0.000008817979,0.0001315698,0.0000603268,0.0002677672,0.00001943956,0.0003465949,0.00004920669,0.0001209777,0.00008408561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003799061,"about_ca_system_score_gemma":0.00006557305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009960696,"about_ca_topic_score_gemma":0.00007169662,"domain_scores_codex":[0.9988653,0.00003779384,0.0002244343,0.000352644,0.0002261596,0.0002936623],"domain_scores_gemma":[0.9994298,0.00004238696,0.00006319202,0.0002867194,0.0001112386,0.00006672809],"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.00002610728,0.0001551638,0.001339959,0.00002174384,0.00002488818,0.00002622194,0.0001653978,0.403381,0.0001631435,0.2010991,0.003433537,0.3901637],"study_design_scores_gemma":[0.000422834,0.00002287615,0.00015435,0.00001498651,0.000005833049,0.00001771167,0.00002096743,0.9902766,0.00009208721,0.007582445,0.001216889,0.0001723979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.247472,0.0001221098,0.7467668,0.0008703453,0.0005896083,0.0001081214,0.000001080455,0.0004165387,0.003653367],"genre_scores_gemma":[0.9977998,0.00000460893,0.001218754,0.0002594131,0.0004130173,0.000022285,0.00000450118,0.000008323471,0.0002693469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7503277,"threshold_uncertainty_score":0.536526,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870753,0.0002049837,0.000221162,0.00007996152,0.0002983447,0.000448874,0.0008030332,0.0000999385,0.00003384355],"category_scores_gemma":[0.000004531812,0.0002035771,0.0001024642,0.0003591929,0.00003228823,0.000522483,0.0003455043,0.0002222618,0.00008264955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067011,"about_ca_system_score_gemma":0.00007274484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006262309,"about_ca_topic_score_gemma":0.0001255071,"domain_scores_codex":[0.9983716,0.00006749057,0.0003192872,0.0004420399,0.0002632584,0.000536346],"domain_scores_gemma":[0.9991688,0.00004690091,0.0001328892,0.0005230622,0.00004295171,0.00008538499],"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.00005760311,0.0004746585,0.0135766,0.0002362062,0.00009316765,0.0004181401,0.0006959665,0.4920884,0.02273916,0.2722527,0.001358573,0.1960088],"study_design_scores_gemma":[0.0004666109,0.00003645484,0.003885903,0.0001371508,0.00000793894,0.00007877235,0.00002263503,0.9646274,0.0006645386,0.02571206,0.00390505,0.0004555206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2470592,0.0001449256,0.7494867,0.000347331,0.000364183,0.0009283572,0.000002800199,0.0002605665,0.001405949],"genre_scores_gemma":[0.7580025,0.000001983701,0.2412964,0.0001959845,0.0002618518,0.0001011226,0.00000470982,0.00001912373,0.0001163222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5109433,"threshold_uncertainty_score":0.8301634,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948214,0.0001902383,0.0003736329,0.0003017671,0.0001169782,0.00006713607,0.0003719595,0.0001423575,0.00003512097],"category_scores_gemma":[0.00005513413,0.00019822,0.000159895,0.0006795021,0.00004359488,0.00009855959,0.00003507977,0.0001338295,0.00003683254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000130625,"about_ca_system_score_gemma":0.00001089469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000499652,"about_ca_topic_score_gemma":0.0004209512,"domain_scores_codex":[0.9989074,0.00004659417,0.0003868013,0.000205394,0.00008843635,0.0003653016],"domain_scores_gemma":[0.9988543,0.0002415033,0.00006571796,0.0007272059,0.00006228607,0.00004903351],"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.00001797602,0.0001393588,0.007755737,0.0001899541,0.001414545,0.000005134967,0.0003925476,0.9619203,0.007927999,0.01136799,0.007940785,0.0009276817],"study_design_scores_gemma":[0.0005856829,0.00002563415,0.002686889,0.00002145223,0.0003812298,0.000002886681,0.0001820264,0.9782444,0.001175339,0.0008054159,0.0155774,0.0003116475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5575723,0.0009662056,0.4369427,0.0002837926,0.0005334939,0.0007143401,0.0001812276,0.001182289,0.001623641],"genre_scores_gemma":[0.9959211,0.0000163517,0.003057901,0.00002981543,0.00004926405,0.0002818361,0.0001209828,0.00003952174,0.0004832491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4383488,"threshold_uncertainty_score":0.8083178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889802,0.0001006261,0.0001487248,0.0000912717,0.0001084348,0.00004919793,0.000276197,0.00006049601,0.000003560647],"category_scores_gemma":[0.00006550657,0.0001047294,0.00003878451,0.000189796,0.00008355064,0.0001318576,0.0002238654,0.00009406996,0.000004875614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007112699,"about_ca_system_score_gemma":0.00004111885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004303041,"about_ca_topic_score_gemma":0.0001033606,"domain_scores_codex":[0.9990494,0.00005395859,0.0002256187,0.0002692623,0.0002325046,0.0001692821],"domain_scores_gemma":[0.999333,0.0001151361,0.0001357893,0.0002534125,0.0001291364,0.00003356875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003790313,0.001015061,0.3424211,0.000366739,0.00003832494,0.00005954363,0.001777236,0.00151528,0.1301071,0.4766482,0.007657379,0.03835605],"study_design_scores_gemma":[0.0004468701,0.0001026462,0.5902965,0.0001654498,0.00001307911,0.00009204391,0.00004204331,0.2566004,0.1335956,0.01787602,0.0003737984,0.0003955067],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7856324,0.00007883663,0.21164,0.000187859,0.0001937925,0.0001060958,0.000003793966,0.000241806,0.001915388],"genre_scores_gemma":[0.9697585,0.000002930002,0.03010249,0.00003701068,0.00003386416,0.000004164544,0.000003463331,0.000003966481,0.00005362717],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4587722,"threshold_uncertainty_score":0.427074,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001382837,0.00020922,0.0002234902,0.00007135483,0.0001266875,0.00007124228,0.0002016023,0.0002416461,0.00003009987],"category_scores_gemma":[0.00004393615,0.0002202925,0.00008434182,0.0003286063,0.00005037007,0.0002801715,0.00007476143,0.0002366063,0.00003558665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002320756,"about_ca_system_score_gemma":0.000004781371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001224709,"about_ca_topic_score_gemma":0.00030031,"domain_scores_codex":[0.9987702,0.00001218241,0.0002907421,0.0002671166,0.0000950069,0.0005647669],"domain_scores_gemma":[0.9995244,0.00005470327,0.00004206922,0.0002882234,0.00004878603,0.00004179115],"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.00008570358,0.0001069834,0.0004628259,0.0001620831,0.00005610244,0.000004115614,0.000007728108,0.8060898,0.005009616,0.008831548,0.02678407,0.1523994],"study_design_scores_gemma":[0.0003578205,0.00009095608,0.0005164127,0.00006026213,0.00001378378,0.000004852656,0.00001629869,0.9589042,0.0006264213,0.01471663,0.0243943,0.0002980836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007810975,0.0005585786,0.9863176,0.0001495038,0.0005316442,0.0007534563,0.00001930348,0.002188936,0.001669972],"genre_scores_gemma":[0.8953332,0.00003862332,0.1031784,0.00002468532,0.0004188627,0.00054258,0.0001063438,0.00007235752,0.0002849236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8875222,"threshold_uncertainty_score":0.8983268,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002684945,0.000251019,0.0002622564,0.0001485452,0.0001380628,0.0001342279,0.0006173175,0.0001613725,0.00001508733],"category_scores_gemma":[0.00002350754,0.000253664,0.00008793699,0.0008114156,0.00002666019,0.0002043197,0.0001686104,0.0002515001,0.0001528393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001803556,"about_ca_system_score_gemma":0.00002119314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001642036,"about_ca_topic_score_gemma":0.002410709,"domain_scores_codex":[0.9977871,0.0001466116,0.0004254736,0.0006126748,0.0003583883,0.0006697616],"domain_scores_gemma":[0.9988808,0.0001332718,0.0001468952,0.0007120011,0.00004673731,0.0000802899],"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.00001011864,0.0001744939,0.02756229,0.000004060746,0.000003941359,0.0000451214,0.00003278862,0.9459448,0.00003936878,0.01676124,0.002456946,0.006964793],"study_design_scores_gemma":[0.000638101,0.00002880547,0.351016,0.00006525834,0.000002572092,0.00001124279,0.000003393881,0.6456653,0.00007259748,0.0004671293,0.001741501,0.0002881044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.529218,0.0002275669,0.4631755,0.001010311,0.00171576,0.000326281,0.000008466652,0.0005381232,0.003779987],"genre_scores_gemma":[0.8894883,0.000004985681,0.1088666,0.0005684647,0.0003226859,0.00001196391,0.00003255135,0.00002236907,0.0006820041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3602704,"threshold_uncertainty_score":0.9999915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009875973,0.00009458757,0.00008642886,0.00009349348,0.0000578539,0.00002593408,0.0002976629,0.00009346669,0.00007340845],"category_scores_gemma":[0.00002950398,0.00007686861,0.00002713288,0.0003103492,0.00006135731,0.00005032137,0.00002215297,0.0002986371,0.0001918723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001779985,"about_ca_system_score_gemma":0.000007794325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004893392,"about_ca_topic_score_gemma":0.0005793794,"domain_scores_codex":[0.9994832,0.00003430866,0.0001811814,0.00009091769,0.0000658265,0.0001445689],"domain_scores_gemma":[0.9993829,0.0001227824,0.00002386798,0.0004375815,0.0000207943,0.00001211039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0000569998,0.0003265977,0.1361027,0.00001767121,0.00005140743,0.00001231874,0.000523757,0.7181694,0.01464018,0.05428408,0.05085024,0.0249647],"study_design_scores_gemma":[0.001191094,0.00006306548,0.6252452,0.0001084598,0.00001478636,0.00001360494,0.0003639484,0.2236861,0.00734954,0.007931348,0.1335339,0.000499056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9752607,0.0001664586,0.00108569,0.001007949,0.0001806122,0.0001669318,0.000008714519,0.0004174804,0.02170551],"genre_scores_gemma":[0.9993703,0.00003704557,0.0002849404,0.00005352178,0.00000974894,0.00002886507,0.00004583449,0.00001235509,0.000157427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4944833,"threshold_uncertainty_score":0.3134611,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498548,0.0001560557,0.0002373828,0.0000892426,0.0001998319,0.0001885049,0.0006836453,0.00004554265,0.0001615393],"category_scores_gemma":[0.0000288732,0.0001442969,0.00002979458,0.0005311717,0.00008910708,0.0003182087,0.0003217609,0.0001652308,0.00003564519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004315366,"about_ca_system_score_gemma":0.00009008453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003013757,"about_ca_topic_score_gemma":0.0002563111,"domain_scores_codex":[0.9987624,0.00008046885,0.0003755562,0.0002685009,0.0002403722,0.0002726771],"domain_scores_gemma":[0.9987668,0.0001549109,0.0001566475,0.0005563208,0.0002997234,0.00006562621],"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.00004308065,0.000540243,0.01262125,0.0001156898,0.0001275699,0.00006886743,0.002772979,0.008442399,0.005138546,0.9067168,0.02395026,0.03946238],"study_design_scores_gemma":[0.002177495,0.0004081444,0.03544575,0.0002300719,0.00002969659,0.00005734712,0.0001137383,0.9345436,0.005721773,0.00633264,0.01415037,0.0007893876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04361298,0.0001312927,0.9494901,0.0002856267,0.0002141859,0.0001483442,0.00001010818,0.00006476213,0.006042605],"genre_scores_gemma":[0.9040152,0.00002050073,0.09496984,0.0001703313,0.00004897808,0.000009868063,0.00001910516,0.00001107947,0.0007350617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9261012,"threshold_uncertainty_score":0.5884255,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002720135,0.000305975,0.0002751646,0.0001021648,0.0002735719,0.0003456725,0.001184175,0.0001475309,0.00001524086],"category_scores_gemma":[0.000005033948,0.0003195475,0.0001662186,0.0003510501,0.00005744764,0.0001501684,0.0003381636,0.0001528928,0.00006248673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160935,"about_ca_system_score_gemma":0.00001374309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007217031,"about_ca_topic_score_gemma":0.00005804953,"domain_scores_codex":[0.997524,0.00007666936,0.0004058126,0.0007924506,0.0003552699,0.0008458469],"domain_scores_gemma":[0.9983227,0.00008877306,0.0001390484,0.001182632,0.0001009537,0.0001658692],"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.0000264756,0.0003406609,0.0002311248,0.0000309516,0.00005004098,0.0001079928,0.00009922233,0.9193252,0.00004723742,0.06017073,0.006032775,0.01353758],"study_design_scores_gemma":[0.0006627528,0.00009674521,0.0005077039,0.00002171042,0.00001529347,0.00004784908,0.00001550924,0.9755934,0.0003132193,0.001113048,0.02121254,0.0004002656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1383791,0.0004189448,0.8560055,0.0003902928,0.001352247,0.0007727867,0.00001119061,0.0006181147,0.002051835],"genre_scores_gemma":[0.791074,0.00001674639,0.2070408,0.0007094294,0.0006832524,0.00008234878,0.00004537207,0.00003978896,0.0003082106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6526949,"threshold_uncertainty_score":0.9999257,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001211256,0.0001793838,0.0002530232,0.0002349735,0.00004350013,0.00001505251,0.0002066477,0.00008596859,0.00001178123],"category_scores_gemma":[0.00001071551,0.000178221,0.00003849326,0.0003940683,0.00004329707,0.0002325849,0.00004814085,0.0001609,0.000005405773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166453,"about_ca_system_score_gemma":0.000007640202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000215412,"about_ca_topic_score_gemma":0.00007573894,"domain_scores_codex":[0.9991899,0.00002455589,0.000289202,0.0001500642,0.0001059171,0.000240342],"domain_scores_gemma":[0.9994491,0.00008686872,0.00006815198,0.0003259964,0.00004147574,0.00002836367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001663178,0.00003574979,0.000505761,0.00006556149,0.00001123884,0.0000043693,0.00008390054,0.7551519,0.2419331,0.00005527285,0.00003542634,0.002101092],"study_design_scores_gemma":[0.0003133717,0.0001104969,0.002105073,0.0001767754,0.000007247333,0.00001019737,0.00004417696,0.2538742,0.7417825,0.001261025,0.00007700999,0.0002379815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8421797,0.001072926,0.1546288,0.00002179184,0.0000762623,0.000307036,0.000007776393,0.0007478705,0.0009579306],"genre_scores_gemma":[0.9915704,0.0001161506,0.008121509,0.000005609145,0.00002941755,0.00008911293,0.00001282612,0.00004331558,0.00001168071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5012777,"threshold_uncertainty_score":0.7267641,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447075,0.0001187797,0.0001942234,0.00006263357,0.0002456301,0.00004186286,0.0009121812,0.00005169245,0.00004184168],"category_scores_gemma":[0.000007091453,0.0001154252,0.00004366756,0.0006424221,0.00007565253,0.0004113259,0.001255265,0.0001706623,0.00001495145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007572835,"about_ca_system_score_gemma":0.00003864711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002388743,"about_ca_topic_score_gemma":0.0005074715,"domain_scores_codex":[0.9990362,0.0001167274,0.0002450465,0.0002368698,0.0001432674,0.0002218843],"domain_scores_gemma":[0.9991488,0.00007543256,0.00008946778,0.0005305008,0.0001231459,0.00003263908],"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.00009401234,0.0008771972,0.2171093,0.00004153721,0.00004643543,0.00001982293,0.004994016,0.177257,0.0004269893,0.04493846,0.01291737,0.5412779],"study_design_scores_gemma":[0.001602123,0.0004299349,0.247163,0.0001509787,0.000008128632,0.000007994883,0.0001084192,0.698606,0.001333587,0.0003611998,0.04964897,0.0005796697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9289232,0.01211612,0.05157076,0.0002359143,0.0002440953,0.0002934149,0.00000272023,0.0000898149,0.006523968],"genre_scores_gemma":[0.9926668,0.004421867,0.002485254,0.0001380149,0.00002810734,0.00001348745,0.000006288676,0.000003950328,0.0002362396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5406982,"threshold_uncertainty_score":0.4706901,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001216106,0.0002080939,0.0002395556,0.0001290988,0.00007720739,0.00004625268,0.0002915933,0.0001235082,0.00003619799],"category_scores_gemma":[0.00003914627,0.0002302226,0.00004441233,0.000246004,0.00004108852,0.00051122,0.00004013914,0.0002003159,0.00001501335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002389874,"about_ca_system_score_gemma":0.00001399159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002043063,"about_ca_topic_score_gemma":0.0002814757,"domain_scores_codex":[0.9990486,0.00004403693,0.0002899489,0.0002285038,0.00008436481,0.0003045596],"domain_scores_gemma":[0.9993003,0.0000954284,0.00006597812,0.0003984293,0.00009147006,0.00004842039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001959684,0.0009070588,0.02785992,0.0008882249,0.0002321543,0.00008381433,0.008500659,0.2742971,0.4447052,0.1504843,0.01594632,0.07589924],"study_design_scores_gemma":[0.003939763,0.0002028462,0.007009191,0.0006271756,0.00002716454,0.0000219318,0.000705048,0.4746817,0.4495087,0.0384144,0.02289206,0.001969975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7075291,0.00133279,0.2802155,0.0003280278,0.0003798594,0.001698313,0.0001899753,0.0025705,0.005755872],"genre_scores_gemma":[0.933864,0.00010414,0.06541308,0.00003609249,0.00005576959,0.0001835915,0.0001511104,0.00004810869,0.000144089],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2263349,"threshold_uncertainty_score":0.9388207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}