{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":74,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":74,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"6611ad8c03c0","filters":{"venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."}},"results":[{"id":"W2138160752","doi":"10.1109/glocom.2005.1578206","title":"Energy efficient information collection with the ARIMA model in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoregressive integrated moving average; Wireless sensor network; Computer science; Wireless; Computer network; Data mining; Telecommunications; Time series; Machine learning","authors":[{"name":"Chong Liu","is_ca":true},{"name":"Kui Wu","is_ca":true},{"name":"Min Tsao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01193645325322392,"gpt":0.2238288881348829,"spread":0.2118924348816589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003022778,0.0008824827,0.001132758,0.0007114608,0.0005477254,0.001131176,0.001528554,0.001039615,0.0006411191],"category_scores_gemma":[0.007333118,0.0006107419,0.0008741882,0.001419099,0.0008067595,0.002804144,0.001006347,0.001779077,0.0002956545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006727778,"about_ca_system_score_gemma":0.000998901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00658245,"about_ca_topic_score_gemma":0.004916239,"domain_scores_codex":[0.9977419,0.001016723,0.0001228053,0.0003464804,0.0006399767,0.0001320775],"domain_scores_gemma":[0.9974346,0.001775921,0.0001956531,0.0002818201,0.0002715062,0.0000406606],"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.0002063527,0.0001073597,0.001534849,0.0001442072,0.0001837914,0.0001503877,0.0002122268,0.8387201,0.005977555,0.04021871,0.001154255,0.1113903],"study_design_scores_gemma":[0.00000746711,0.00004322887,0.0001517818,0.000006049634,0.00001640337,0.00002144233,0.00001053853,0.9875843,0.000737134,0.01080592,0.0005999648,0.00001571273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008057756,0.0005046185,0.9904116,0.0001519015,0.00004031348,0.00001800713,0.0000287223,0.000220894,0.0005661716],"genre_scores_gemma":[0.7191776,0.002553229,0.2725779,0.0002461956,0.0003451857,0.0002618475,0.0002674006,0.0001296935,0.004440919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00658245,"threshold_uncertainty_score":0.01598614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151152523","doi":"10.1109/glocom.2005.1578433","title":"Locally optimal relay node placement in heterogeneous wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":64,"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":"Relay; Wireless sensor network; Computer science; Computer network; Heuristic; Node (physics); Key distribution in wireless sensor networks; Distributed computing; Grid; Wireless network; Wireless; Engineering; Telecommunications; Mathematics; Power (physics)","authors":[{"name":"Quanhong Wang","is_ca":true},{"name":"Kenan Xu","is_ca":false},{"name":"Glen Takahara","is_ca":true},{"name":"Hossam Hassanein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01775776228061031,"gpt":0.2557282246524422,"spread":0.2379704623718319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975015,0.0006539252,0.0007544588,0.0004820015,0.0003898396,0.0006774034,0.0007482447,0.0006738025,0.0005244396],"category_scores_gemma":[0.002665145,0.0004141108,0.0002898396,0.0005152232,0.0006064996,0.001102566,0.0008208033,0.0003090347,0.0002053103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005720047,"about_ca_system_score_gemma":0.0003445421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008015258,"about_ca_topic_score_gemma":0.0009856396,"domain_scores_codex":[0.9994115,0.0002627489,0.0000272425,0.0001267213,0.0001128446,0.00005900943],"domain_scores_gemma":[0.9994113,0.0003253995,0.0001051098,0.00006833341,0.00005558678,0.00003420379],"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.00008371283,0.00001816853,0.0003775521,0.00004724451,0.00002325211,0.0001889393,0.00004578121,0.9622251,0.008044477,0.009314843,0.0004032243,0.01922765],"study_design_scores_gemma":[0.00001554289,0.00006848425,0.0001441831,0.000004937825,0.000009704409,0.00005048691,0.00004584548,0.9866437,0.002596911,0.009905514,0.0005066695,0.000008009762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05325643,0.0004422923,0.9446902,0.00009760878,0.00002338936,0.0000294657,0.0000295179,0.0002153089,0.00121581],"genre_scores_gemma":[0.8843467,0.0004399694,0.1137106,0.00003782352,0.00002408315,0.00006811734,0.00007049483,0.00005958174,0.001242583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.000975015,"threshold_uncertainty_score":0.005156398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169032273","doi":"10.1109/glocom.2005.1578205","title":"Reactive cognitive radio algorithms for co-existence between IEEE 802.11b and 802.16a networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Cognitive radio; Computer science; Computer network; Throughput; Radio resource management; Interference (communication); Co-channel interference; Wireless; Frequency band; IEEE 802.11; Power control; Wireless network; Channel (broadcasting); Telecommunications; Power (physics); Bandwidth (computing)","authors":[{"name":"Xiangpeng Jing","is_ca":false},{"name":"Siun-Chuon Mau","is_ca":false},{"name":"Dipankar Raychaudhuri","is_ca":false},{"name":"R. Matyas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03399956503745423,"gpt":0.2982001884013845,"spread":0.2642006233639302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277366,0.001059456,0.0007134634,0.0007167089,0.0009016856,0.001349921,0.001931189,0.001021302,0.001926125],"category_scores_gemma":[0.008593713,0.0004477644,0.0005118818,0.0006304657,0.001429494,0.001661212,0.001735884,0.001605643,0.0003228478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008653549,"about_ca_system_score_gemma":0.001334346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003000338,"about_ca_topic_score_gemma":0.002725817,"domain_scores_codex":[0.9986981,0.00045628,0.00004858546,0.0001652574,0.0004557759,0.0001759762],"domain_scores_gemma":[0.9959377,0.002750461,0.0004582361,0.0002477831,0.0004778668,0.0001279079],"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.0001187857,0.00009157301,0.0004754692,0.00006648839,0.00007962089,0.00008905143,0.0002144496,0.8527735,0.002407778,0.08161023,0.001110503,0.06096262],"study_design_scores_gemma":[0.00002371032,0.00004388275,0.00004826504,0.000006346502,0.00001294091,0.00003083465,0.00001867354,0.9853388,0.0004210166,0.01326181,0.0007848319,0.000008819912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008332356,0.0001899303,0.9879078,0.0001277519,0.00005615459,0.00003793838,0.000004886374,0.0001679304,0.003175218],"genre_scores_gemma":[0.7990959,0.0003503802,0.1965668,0.0002209798,0.0001014392,0.0002659802,0.0000302984,0.0000758551,0.003292421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003277366,"threshold_uncertainty_score":0.01733255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121938034","doi":"10.1109/glocom.2005.1578374","title":"On the optimal number of hops in infrastructure-based fixed relay networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"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":"Hop (telecommunications); Relay; Computer science; Computer network; Wireless network; Spectral efficiency; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Channel (broadcasting); Power (physics)","authors":[{"name":"Alina Alexandra Florea","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02535904658105658,"gpt":0.2866593748546485,"spread":0.261300328273592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043477,0.0008727018,0.0006822505,0.00122062,0.0006244697,0.001178651,0.001043702,0.0009251668,0.001471122],"category_scores_gemma":[0.01022265,0.0005892487,0.0003006599,0.0009469353,0.002089766,0.002561647,0.000750581,0.0005428241,0.0002402327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263979,"about_ca_system_score_gemma":0.0006782725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009207596,"about_ca_topic_score_gemma":0.001069314,"domain_scores_codex":[0.9990208,0.0005208594,0.00003113281,0.0001260643,0.0001652943,0.0001358449],"domain_scores_gemma":[0.9944053,0.004359318,0.0005841334,0.0001879843,0.0003143416,0.0001488318],"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.0001238715,0.00002987288,0.0007385021,0.00007961506,0.00002837844,0.0001261403,0.00008281317,0.9144031,0.002441818,0.07099781,0.0004217299,0.0105264],"study_design_scores_gemma":[0.00004910901,0.0001834538,0.0006148962,0.00005499786,0.00004299924,0.0001537203,0.0001977177,0.9199042,0.002203659,0.07524502,0.001322375,0.00002791132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2655025,0.003239974,0.7180557,0.0005510663,0.00005958058,0.00009135868,0.00010368,0.0001359613,0.01226011],"genre_scores_gemma":[0.9439666,0.001806155,0.05205752,0.000052732,0.00004679019,0.00009066658,0.00004692448,0.00005779052,0.00187489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002043477,"threshold_uncertainty_score":0.01080704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117764384","doi":"10.1109/glocom.2005.1578462","title":"Queue-aware uplink bandwidth allocation for polling services in 802.16 broadband wireless networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Polling; Computer network; Computer science; Wireless broadband; Telecommunications link; Quality of service; Bandwidth allocation; Queueing theory; Scheduling (production processes); Broadband networks; Queue; Bandwidth (computing); Wireless; IEEE 802; Call Admission Control; Broadband; Wireless network; Telecommunications; Engineering","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01320950270994596,"gpt":0.2524519355441666,"spread":0.2392424328342206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001863674,0.0002886147,0.0005318994,0.0003939926,0.0006981997,0.0008639762,0.0009790396,0.0005771976,0.0005238284],"category_scores_gemma":[0.004839467,0.0002549221,0.0002242733,0.0005061704,0.000627612,0.0007884341,0.0005876945,0.0005325815,0.00007461476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001354941,"about_ca_system_score_gemma":0.001152531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003162711,"about_ca_topic_score_gemma":0.003263144,"domain_scores_codex":[0.9993774,0.0002551184,0.00003302997,0.00006471643,0.0001643849,0.0001054085],"domain_scores_gemma":[0.9990296,0.0005195216,0.0001470426,0.00009927932,0.0001490026,0.0000554509],"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.0003088194,0.0001690507,0.003186096,0.0001130296,0.00005743394,0.0002888231,0.0003142665,0.8022602,0.03432256,0.06073741,0.00214443,0.09609789],"study_design_scores_gemma":[0.0000127604,0.0000313152,0.0002181947,0.000003054945,0.000009107188,0.0000309734,0.00001249965,0.9944049,0.001424785,0.00355294,0.0002914904,0.000007947855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1474739,0.001101802,0.8479609,0.000402373,0.000141631,0.00006815168,0.00002425587,0.0004698917,0.002357081],"genre_scores_gemma":[0.9719005,0.0001772138,0.02736578,0.0000580404,0.00003176317,0.00002469725,0.000007673373,0.00001610923,0.0004182135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003162711,"threshold_uncertainty_score":0.009856164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144774445","doi":"10.1109/glocom.2005.1578203","title":"Connection admission control algorithms for OFDM wireless networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Connection (principal bundle); Queueing theory; Computer science; Admission control; Queue; Computer network; Orthogonal frequency-division multiplexing; Network packet; Wireless; Scheme (mathematics); Wireless network; Algorithm; Real-time computing; Mathematics; Telecommunications; Channel (broadcasting); Quality of service","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01889330178592384,"gpt":0.2675074850987157,"spread":0.2486141833127919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849414,0.0008189908,0.0007413286,0.001015229,0.000784167,0.001587752,0.001601543,0.000860336,0.002836413],"category_scores_gemma":[0.009150576,0.0003138028,0.0003567856,0.001391223,0.0008494387,0.001503206,0.001018638,0.001484506,0.0003982006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002484528,"about_ca_system_score_gemma":0.001591878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007958293,"about_ca_topic_score_gemma":0.004211997,"domain_scores_codex":[0.998623,0.0003659477,0.00006576034,0.0001263709,0.0006257055,0.0001932205],"domain_scores_gemma":[0.9974858,0.001622633,0.0001971375,0.0001399001,0.0004896906,0.0000649018],"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.00008685976,0.00009768132,0.0005540546,0.00007360685,0.00003549229,0.00004042915,0.0001506301,0.770597,0.001781059,0.106671,0.003007017,0.1169052],"study_design_scores_gemma":[0.000006268797,0.000006561409,0.00004880676,0.00000403481,0.000002878974,0.000006572062,0.000005106187,0.9882028,0.0001482587,0.01111342,0.0004514929,0.000003819805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01589715,0.001384545,0.9771851,0.0003786434,0.0001136079,0.0001007003,0.00004873729,0.0004342992,0.004457211],"genre_scores_gemma":[0.802072,0.001940689,0.1899247,0.0002274249,0.0002690131,0.0003401633,0.0001416545,0.0001051456,0.004979213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007958293,"threshold_uncertainty_score":0.01802659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167641880","doi":"10.1109/glocom.2005.1578302","title":"LPT for data aggregation in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":36,"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":"Wireless sensor network; Data aggregator; Computer science; Sink (geography); Computer network; Distributed computing; Tree (set theory); Overlay; Routing protocol; Routing (electronic design automation)","authors":[{"name":"M. Lee","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04590402469165972,"gpt":0.2974597009914756,"spread":0.2515556762998158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971347,0.000692951,0.0008066615,0.0006767887,0.0007296917,0.001018984,0.001191684,0.000954567,0.001867004],"category_scores_gemma":[0.005469099,0.0002872274,0.0006766449,0.001714854,0.0007842126,0.001998428,0.001351034,0.001511318,0.001028399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006994905,"about_ca_system_score_gemma":0.0006924272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007711441,"about_ca_topic_score_gemma":0.0006873659,"domain_scores_codex":[0.9987872,0.0003861035,0.0001062666,0.000182402,0.0004835743,0.00005443912],"domain_scores_gemma":[0.9986839,0.0006956461,0.0001382297,0.0002410249,0.0002042591,0.00003688549],"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.0002684454,0.00008216852,0.0008805309,0.0005882019,0.0001118556,0.0004030438,0.0003210368,0.2416948,0.01266261,0.1341098,0.01297505,0.5959026],"study_design_scores_gemma":[0.00002764483,0.0001293573,0.0001571871,0.00004798716,0.00002895367,0.0002843751,0.00003720519,0.9007922,0.004355861,0.07262405,0.02149689,0.00001815728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001566242,0.0009341028,0.995479,0.0002496812,0.0001416027,0.00005656472,0.00002363793,0.000421946,0.001127179],"genre_scores_gemma":[0.1600481,0.00287773,0.8302007,0.0005413102,0.00046607,0.0006209136,0.000263164,0.0002512034,0.004730728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001971347,"threshold_uncertainty_score":0.01042563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125828703","doi":"10.1109/glocom.2005.1578464","title":"Queueing analysis of OFDM/TDMA systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Manitoba","funders":"","keywords":"Queueing theory; Time division multiple access; Computer science; Layered queueing network; Rayleigh fading; Computer network; Queue; Orthogonal frequency-division multiplexing; Fading; Channel (broadcasting)","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01721836265690664,"gpt":0.2579243439454483,"spread":0.2407059812885416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225491,0.0005889916,0.0004952911,0.000605443,0.0004949223,0.001098526,0.0006879646,0.0005443307,0.002026374],"category_scores_gemma":[0.004451003,0.0002450431,0.0003541611,0.0005012044,0.0006775309,0.001138998,0.0006324211,0.0006264357,0.0002359483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002149143,"about_ca_system_score_gemma":0.001128848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01518575,"about_ca_topic_score_gemma":0.003627425,"domain_scores_codex":[0.9991622,0.0002095787,0.00003554179,0.0001072302,0.0003091609,0.0001762759],"domain_scores_gemma":[0.9987117,0.0006586428,0.0001615934,0.00005313078,0.0003499436,0.00006504406],"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.00006405779,0.00006019097,0.001695247,0.00009212357,0.00005258798,0.0002129868,0.0001725425,0.8669187,0.004748541,0.1130419,0.001311685,0.01162948],"study_design_scores_gemma":[0.000003011768,0.000008797416,0.0001919991,0.00000280891,0.000003736157,0.00001155618,0.00001382711,0.9945075,0.0001652103,0.004859389,0.0002285085,0.000003681648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.174683,0.003414535,0.8029277,0.001118978,0.0002300135,0.0001335069,0.000276859,0.0003641156,0.01685135],"genre_scores_gemma":[0.9800768,0.0009382021,0.01526391,0.0001019385,0.0001300182,0.00005878113,0.00009602663,0.00004398965,0.003290302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01518575,"threshold_uncertainty_score":0.0301947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097475015","doi":"10.1109/glocom.2005.1578379","title":"Theoretical analysis of cooperative diversity in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Cooperative diversity; Fading; Energy consumption; Diversity (politics); Relay; Computer science; Computer network; Wireless sensor network; Perspective (graphical); Wireless network; Efficient energy use; Energy (signal processing); Wireless; Routing protocol; Routing (electronic design automation); Telecommunications; Engineering; Channel (broadcasting); Artificial intelligence; Electrical engineering","authors":[{"name":"Naveen Shastry","is_ca":true},{"name":"Jitendra Bhatia","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03777363530151925,"gpt":0.2940816392251748,"spread":0.2563080039236556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180248,0.0007539698,0.000690426,0.001371046,0.0007960423,0.001535123,0.001768177,0.001442446,0.001959064],"category_scores_gemma":[0.008931722,0.000434359,0.0005273389,0.001641556,0.002412812,0.002814232,0.001480362,0.001509604,0.0004483045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001921552,"about_ca_system_score_gemma":0.0009174139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001146413,"about_ca_topic_score_gemma":0.0006714151,"domain_scores_codex":[0.9986939,0.000401899,0.00003410422,0.00009466061,0.0006547898,0.0001207789],"domain_scores_gemma":[0.9968191,0.002153085,0.0002664666,0.0002251136,0.0004652559,0.00007102574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001006717,0.00001853007,0.0002057552,0.00009599885,0.00001516744,0.00008144272,0.0001253378,0.1989645,0.0008971438,0.7904578,0.001455227,0.007672921],"study_design_scores_gemma":[0.000005476917,0.00002247963,0.00009922644,0.00004434643,0.000006741332,0.00007738781,0.00004861667,0.406144,0.0002609381,0.5902951,0.002984473,0.00001131445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01841249,0.004188186,0.9431079,0.002766679,0.0001976496,0.00004178865,0.0001380272,0.0001005665,0.03104671],"genre_scores_gemma":[0.9128584,0.01089444,0.06568591,0.0009265423,0.0009658514,0.0004742433,0.0001981746,0.0001150202,0.007881376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002180248,"threshold_uncertainty_score":0.01394188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012719569","doi":"10.1109/glocom.2005.1578060","title":"Pilot symbols for channel estimation in OFDM systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":20,"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":"Estimator; Orthogonal frequency-division multiplexing; Algorithm; Channel (broadcasting); Cramér–Rao bound; Computer science; Minimum mean square error; Gaussian; Mathematics; Impulse response; Statistics; Mathematical optimization; Telecommunications","authors":[{"name":"Tao Cui","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03632341136163796,"gpt":0.2970148124218545,"spread":0.2606914010602165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900362,0.0003964153,0.0003341431,0.0002312173,0.0002114815,0.0004647685,0.0003815048,0.0005670203,0.001507488],"category_scores_gemma":[0.003417636,0.000218021,0.0001190858,0.0005387566,0.0004574544,0.0007766585,0.0005203739,0.0006207757,0.0006680561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384545,"about_ca_system_score_gemma":0.000407264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004043836,"about_ca_topic_score_gemma":0.0004930813,"domain_scores_codex":[0.9996878,0.0001387448,0.00001352976,0.00004067367,0.00009951911,0.00001968286],"domain_scores_gemma":[0.9993026,0.0003998273,0.00005311604,0.000128442,0.00009534883,0.00002068007],"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.0004104393,0.0000865172,0.001097635,0.0004712527,0.00006424454,0.0006771415,0.0002722381,0.2660846,0.04059659,0.121067,0.008372318,0.5608],"study_design_scores_gemma":[0.00007440431,0.000332076,0.000685547,0.0001245949,0.00004977,0.0004760221,0.00006262103,0.8812759,0.02759252,0.06867797,0.02061574,0.00003279716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0148914,0.001810326,0.9804898,0.0002107128,0.0001532117,0.00002793979,0.00005532992,0.0003122945,0.002048962],"genre_scores_gemma":[0.4769126,0.002667826,0.5163839,0.000248252,0.0003859697,0.0001223873,0.0002354196,0.00006446474,0.002979213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001507488,"threshold_uncertainty_score":0.00504303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085601259","doi":"10.1109/glocom.2005.1577919","title":"Distributed space-time block coding","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"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 science; Node (physics); Block code; Wireless sensor network; Code (set theory); Wireless ad hoc network; Coding (social sciences); Block (permutation group theory); Matrix (chemical analysis); Space–time block code; Decoding methods; Set (abstract data type); Algorithm; Theoretical computer science; Wireless; Mathematics; Computer network; Combinatorics; Telecommunications; Engineering","authors":[{"name":"Simon Yiu","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Lutz Lampe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03307642726339382,"gpt":0.2837614291637141,"spread":0.2506850019003203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171657,0.0004684546,0.0006086453,0.000435484,0.0003378501,0.0008441319,0.0007376166,0.0005768533,0.002513836],"category_scores_gemma":[0.001609117,0.0001792068,0.0002873375,0.0009600967,0.000600032,0.0008556161,0.0007840781,0.0008325557,0.001255213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007180907,"about_ca_system_score_gemma":0.0009131078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001556942,"about_ca_topic_score_gemma":0.001974883,"domain_scores_codex":[0.9991508,0.0002185155,0.00003312798,0.0001268404,0.0003741653,0.00009664982],"domain_scores_gemma":[0.9991114,0.0002812234,0.00007274007,0.0002149673,0.0002843145,0.0000353256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000362779,0.00007859336,0.0007013325,0.0002334465,0.00006724043,0.0002067076,0.0001073522,0.2216716,0.02563841,0.4579491,0.01032184,0.2826616],"study_design_scores_gemma":[0.00006089301,0.0001363154,0.0002375633,0.00003473625,0.00002546159,0.0002898335,0.00002220363,0.8816088,0.00996548,0.07367713,0.03391583,0.00002576467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004845183,0.0009238158,0.9866149,0.0001759297,0.0002116703,0.00004886538,0.0001317841,0.0002448767,0.00680302],"genre_scores_gemma":[0.5168122,0.003122758,0.4593431,0.0004399628,0.0003621524,0.0003517336,0.0009656329,0.00008793508,0.01851448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002513836,"threshold_uncertainty_score":0.00840956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142122479","doi":"10.1109/glocom.2005.1577852","title":"Low-density parity-check convolutional codes applied to packet based communication systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Error Correcting Code Techniques","field":"Computer Science","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":"Low-density parity-check code; Encoder; Convolutional code; Computer science; Serial concatenated convolutional codes; Network packet; Turbo code; Algorithm; Decoding methods; Communications system; Forward error correction; Block code; Theoretical computer science; Concatenated error correction code; Computer network","authors":[{"name":"Zhengang Chen","is_ca":true},{"name":"Stephen Bates","is_ca":true},{"name":"Xiaodai Dong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02794713059522206,"gpt":0.2825641169939033,"spread":0.2546169863986812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003908789,0.0003871555,0.0002678424,0.0003933891,0.0003073669,0.0005589688,0.0003266973,0.0005772769,0.000842778],"category_scores_gemma":[0.002581052,0.0001720594,0.0001724989,0.0006101028,0.000589297,0.000426926,0.000406884,0.0006253547,0.0002292764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007952398,"about_ca_system_score_gemma":0.0008404376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002635113,"about_ca_topic_score_gemma":0.001974847,"domain_scores_codex":[0.9996604,0.0001057948,0.00001317144,0.0000285459,0.0001572161,0.00003490876],"domain_scores_gemma":[0.9990954,0.0005782027,0.00005975972,0.00009106092,0.0001626564,0.00001280919],"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.00009461716,0.00003219052,0.001546928,0.000296748,0.00003513072,0.00044659,0.0001849422,0.533044,0.03071114,0.3280026,0.001317542,0.1042876],"study_design_scores_gemma":[0.000008260781,0.00004868113,0.0002445709,0.00002772035,0.00001653107,0.000150372,0.00001221196,0.9463013,0.01278584,0.03630754,0.004086664,0.00001025624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03431302,0.001008444,0.9575102,0.0002540632,0.00008783782,0.00004758579,0.0000344076,0.0002719082,0.006472513],"genre_scores_gemma":[0.8521001,0.002319047,0.1411819,0.0001231876,0.00007742256,0.00008066812,0.0000543252,0.00004276344,0.004020638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002635113,"threshold_uncertainty_score":0.005769908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142738316","doi":"10.1109/glocom.2005.1577745","title":"Applying PR-SCTP to transport SIP traffic","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"IPv6, Mobility, Handover, Networks, Security","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 British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Retransmission; Computer network; Session Initiation Protocol; Computer science; Transport layer; Reliability (semiconductor); Session (web analytics); The Internet; Layer (electronics); Network packet; Server; Operating system; Chemistry","authors":[{"name":"Xiao‐Lei Wang","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01949275506847804,"gpt":0.2542898951288035,"spread":0.2347971400603254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233979,0.0004165834,0.0002583835,0.0005919746,0.0004622108,0.000701759,0.0007301665,0.0005635137,0.0004487842],"category_scores_gemma":[0.003132695,0.0001670907,0.0002891667,0.0004265287,0.0005562874,0.000779431,0.0007516351,0.0007596915,0.0003801972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002995358,"about_ca_system_score_gemma":0.0004814475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009444837,"about_ca_topic_score_gemma":0.0008009085,"domain_scores_codex":[0.9991635,0.0002298377,0.00007561107,0.00009127327,0.0003586768,0.00008108249],"domain_scores_gemma":[0.9977607,0.0004427594,0.0001474032,0.0006772727,0.0009106541,0.00006127557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004106245,0.0002245286,0.005256024,0.0005197802,0.0001316328,0.001521122,0.0006654161,0.06594647,0.4973232,0.02198715,0.004030332,0.4019837],"study_design_scores_gemma":[0.0000528425,0.00114995,0.002821452,0.00009513383,0.0001364698,0.00293847,0.0002661479,0.6324819,0.3191767,0.009573895,0.03122279,0.00008433689],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2254114,0.0008207342,0.7560101,0.0007175354,0.0002472192,0.0003802233,0.00008661598,0.002727036,0.01359921],"genre_scores_gemma":[0.8851778,0.0004604904,0.1117499,0.0002002804,0.0001343559,0.00009441664,0.0001610247,0.00006978132,0.001951969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001233979,"threshold_uncertainty_score":0.006525993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108375697","doi":"10.1109/glocom.2005.1578339","title":"Burst-based orthogonal ST block coding for CPM","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Continuous phase modulation; Block code; Algorithm; Computer science; Coding (social sciences); Bit error rate; Electronic engineering; Mathematics; Telecommunications; Decoding methods; Engineering","authors":[{"name":"Anna-Marie Silvester","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Lutz Lampe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02942830696673206,"gpt":0.2902264852009385,"spread":0.2607981782342065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658878,0.0005089552,0.0003953011,0.0004333146,0.0002947505,0.000462455,0.0005291228,0.0006698074,0.002066619],"category_scores_gemma":[0.002047844,0.0001864256,0.0002444022,0.0008509877,0.0005062111,0.0007228188,0.0006929111,0.0007736126,0.0006345432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004595693,"about_ca_system_score_gemma":0.000570735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006417873,"about_ca_topic_score_gemma":0.0009812971,"domain_scores_codex":[0.9995098,0.0001763226,0.00002467941,0.00004266229,0.0002062893,0.00004030915],"domain_scores_gemma":[0.9990355,0.0004931515,0.00009316883,0.0001624493,0.0001920149,0.00002383467],"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.0003870513,0.00006841954,0.0006061338,0.000337955,0.00005625199,0.0002703048,0.000187849,0.1788902,0.1000792,0.4281178,0.002503128,0.2884957],"study_design_scores_gemma":[0.00003757548,0.000154152,0.0001664593,0.00005796478,0.00002019558,0.0002341675,0.00001390286,0.9356065,0.01419234,0.03947503,0.01001632,0.00002539699],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01063386,0.0005302778,0.9853014,0.0001393859,0.00008615557,0.00003831803,0.00004362576,0.0001529475,0.003074004],"genre_scores_gemma":[0.4939296,0.001616849,0.4972648,0.0003218306,0.000255331,0.0002390317,0.0002541116,0.00007323363,0.006045395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002066619,"threshold_uncertainty_score":0.006913483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143021806","doi":"10.1109/glocom.2005.1577887","title":"Precise bit error probability analysis of DCT OFDM in the presence of carrier frequency offset on AWGN channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"PAPR reduction in OFDM","field":"Engineering","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 Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Additive white Gaussian noise; Phase-shift keying; Discrete cosine transform; Carrier frequency offset; Quadrature amplitude modulation; Computer science; Bit error rate; Algorithm; Electronic engineering; Frequency offset; QAM; Discrete Fourier transform (general); Keying; Mathematics; Telecommunications; White noise; Fourier transform; Fractional Fourier transform; Decoding methods; Engineering; Channel (broadcasting); Fourier analysis","authors":[{"name":"Peng Hui Tan","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04230999826414001,"gpt":0.2958693911485138,"spread":0.2535593928843738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456107,0.0007457734,0.0007233584,0.0008971128,0.0003200943,0.0006033711,0.0005182274,0.0006263097,0.001097592],"category_scores_gemma":[0.01021348,0.0003037416,0.0003336841,0.0007884371,0.0007327442,0.001420984,0.0006281434,0.0006420179,0.0002656051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006363522,"about_ca_system_score_gemma":0.0003964597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218327,"about_ca_topic_score_gemma":0.0009793008,"domain_scores_codex":[0.9978486,0.000400955,0.0001000482,0.00018531,0.001347539,0.0001175279],"domain_scores_gemma":[0.9944952,0.004064864,0.0003722223,0.0004526268,0.0005795875,0.00003547858],"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.0003515132,0.00003281425,0.002715155,0.000196387,0.00007071775,0.0005253606,0.0001409065,0.8515787,0.04730568,0.03728169,0.0004961558,0.05930492],"study_design_scores_gemma":[0.000004477678,0.00005235683,0.001130783,0.00001359495,0.00001659492,0.000277485,0.00001043381,0.9820681,0.01318715,0.002923615,0.0002952221,0.00002023584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07678416,0.0007214689,0.9198949,0.00007691727,0.00003317915,0.0000228828,0.00008782871,0.000274287,0.002104416],"genre_scores_gemma":[0.9050219,0.001174148,0.09207197,0.00004995522,0.00005710416,0.00005846882,0.0001817298,0.00005344106,0.001331465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001456107,"threshold_uncertainty_score":0.007700741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159441471","doi":"10.1109/glocom.2005.1578246","title":"Receiver windowing for reduction of ICI in OFDM systems with carrier frequency offset","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Frequency offset; Computer science; Window (computing); Offset (computer science); Bit error rate; Interference (communication); Window function; Trigonometric functions; Electronic engineering; Reduction (mathematics); Nyquist–Shannon sampling theorem; Nyquist rate; Telecommunications; Mathematics; Engineering; Decoding methods; Spectral density; Channel (broadcasting); Sampling (signal processing)","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"Peng Hui Tan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02189349121280954,"gpt":0.2704374566852393,"spread":0.2485439654724297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004372467,0.0004190996,0.0004298638,0.0002743228,0.0002375714,0.0004650898,0.0003038548,0.0002460277,0.001631224],"category_scores_gemma":[0.001552324,0.0001752673,0.0002058236,0.0004075425,0.0001652365,0.0005830353,0.0002555847,0.0004941085,0.0003961543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001666013,"about_ca_system_score_gemma":0.0003132244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004134923,"about_ca_topic_score_gemma":0.000561081,"domain_scores_codex":[0.9998273,0.00003640153,0.00001276513,0.00002632864,0.00006970844,0.00002754404],"domain_scores_gemma":[0.9996654,0.000185484,0.00003893055,0.00003690365,0.00006092785,0.00001240192],"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.001309746,0.0001011516,0.0007556315,0.0002900733,0.00006990456,0.0003109947,0.0002247376,0.03056786,0.5739362,0.007203915,0.001230297,0.3839995],"study_design_scores_gemma":[0.0001289001,0.001328324,0.003396543,0.00007229734,0.0002486903,0.0009181133,0.00007080898,0.4129535,0.5671233,0.002198023,0.01150122,0.00006024824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170971,0.002466606,0.8217905,0.0001286101,0.0001136313,0.00006729631,0.0000781044,0.001648802,0.002735444],"genre_scores_gemma":[0.6975015,0.002134444,0.2970627,0.00006256656,0.0001815978,0.00005667742,0.0002155125,0.0002276902,0.002557371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001631224,"threshold_uncertainty_score":0.005456984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097081530","doi":"10.1109/glocom.2005.1578328","title":"Maximum network lifetime in fault tolerant sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","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 Toronto","funders":"","keywords":"Computer science; Erasure code; Network packet; Fault tolerance; Computer network; Erasure; Wireless sensor network; Sink (geography); Linear network coding; Communication source; Distributed computing; Real-time computing; Decoding methods; Algorithm","authors":[{"name":"Petar Djukic","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661862419106747,"gpt":0.2536875600252603,"spread":0.2370689358341928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182002,0.0006116463,0.0007319095,0.0006849581,0.00060136,0.0009257853,0.0009877608,0.0009240307,0.001046833],"category_scores_gemma":[0.004247845,0.0003295094,0.0002709189,0.0009557187,0.0007934115,0.002656518,0.001086854,0.0006644277,0.0002466167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028497,"about_ca_system_score_gemma":0.0004678132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003014627,"about_ca_topic_score_gemma":0.0004198136,"domain_scores_codex":[0.9991092,0.0003197569,0.00004409224,0.0001483409,0.0002974565,0.00008119988],"domain_scores_gemma":[0.9987442,0.0007591551,0.0001706097,0.0001266592,0.0001459137,0.00005337741],"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.0002279119,0.00004178138,0.0008727395,0.0008312052,0.00008866848,0.0002400269,0.0003875041,0.6092905,0.01838796,0.1756363,0.00474956,0.1892458],"study_design_scores_gemma":[0.0000349121,0.0001800819,0.0003968519,0.0001323561,0.00005028676,0.0004409859,0.0001015859,0.7832528,0.01029625,0.1848702,0.02020848,0.00003524553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03268433,0.009768202,0.9487439,0.001118558,0.0001375145,0.00004836212,0.0001025721,0.0004703563,0.006926108],"genre_scores_gemma":[0.8618611,0.006871082,0.1265752,0.0002219492,0.0003321802,0.0002296622,0.0001206583,0.0001832966,0.003604897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001182002,"threshold_uncertainty_score":0.007462263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101173152","doi":"10.1109/glocom.2005.1577915","title":"A variational free energy minimization interpretation of multiuser detection in CDMA","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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 Toronto","funders":"","keywords":"Multiuser detection; Maximization; Computer science; Detector; Decoding methods; Minification; Heuristic; Energy (signal processing); Mathematical optimization; Algorithm; Code division multiple access; Mathematics; Artificial intelligence; Telecommunications; Statistics","authors":[{"name":"Darryl Dexu Lin","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02150182340802422,"gpt":0.2814710991454904,"spread":0.2599692757374662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692232,0.0007619584,0.0007325718,0.000663939,0.0004493726,0.001287615,0.001545226,0.001562599,0.001951308],"category_scores_gemma":[0.003177766,0.0005047608,0.0008242241,0.0006332609,0.001939727,0.001766665,0.001606944,0.00177652,0.0003707491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141612,"about_ca_system_score_gemma":0.00098304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001541985,"about_ca_topic_score_gemma":0.001158168,"domain_scores_codex":[0.9993369,0.000313371,0.0000220063,0.00009868731,0.0001703135,0.00005857717],"domain_scores_gemma":[0.999091,0.0005995828,0.00006245715,0.00008551693,0.0001137469,0.00004777215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002003754,0.00002250383,0.0002481907,0.00008802394,0.00003370808,0.00006976142,0.0001277697,0.2227868,0.003576593,0.7567183,0.001278637,0.01502983],"study_design_scores_gemma":[0.000006717839,0.00002062504,0.00008217799,0.0000140453,0.000005186587,0.00004043317,0.00001206813,0.790844,0.0005672918,0.2066762,0.001716709,0.00001459756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001854602,0.0002768699,0.9954067,0.0003540876,0.00003409476,0.00001152014,0.00002147001,0.00001762565,0.002022956],"genre_scores_gemma":[0.4151567,0.00184403,0.5695233,0.0009130412,0.0004322244,0.0002442098,0.000137739,0.0001553526,0.01159352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001951308,"threshold_uncertainty_score":0.008949518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140124754","doi":"10.1109/glocom.2005.1578320","title":"Performance analysis of the node cooperative ARQ scheme for wireless ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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":"Wireless ad hoc network; Computer science; Computer network; Node (physics); Scheme (mathematics); Selective Repeat ARQ; Automatic repeat request; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless network; Wireless; Optimized Link State Routing Protocol; Hybrid automatic repeat request; Telecommunications; Telecommunications link; Network packet; Engineering; Mathematics","authors":[{"name":"Mehrdad Dianati","is_ca":true},{"name":"Xinhua Ling","is_ca":true},{"name":"Kshirasagar Naik","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03751028069615478,"gpt":0.2919866345592695,"spread":0.2544763538631147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215029,0.0008493925,0.0005899975,0.0007772656,0.0005422428,0.0008341022,0.0007211537,0.0006205282,0.001648167],"category_scores_gemma":[0.006392632,0.0002960599,0.0004278394,0.0006934217,0.0009087385,0.0009524154,0.000591789,0.000603922,0.0003385828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002193205,"about_ca_system_score_gemma":0.001009164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00531088,"about_ca_topic_score_gemma":0.002775251,"domain_scores_codex":[0.9988744,0.000393008,0.00002188553,0.00008308914,0.0004453882,0.000182263],"domain_scores_gemma":[0.9971538,0.001882314,0.000180524,0.0001372503,0.0005964173,0.00004975686],"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.00010288,0.00003829864,0.0006816736,0.00007485106,0.00003426327,0.0001145116,0.0001695051,0.9413128,0.007558227,0.03522423,0.0007861396,0.01390266],"study_design_scores_gemma":[0.000002943591,0.00005055124,0.0001631789,0.000003906019,0.00000646031,0.00002426824,0.00001853794,0.997373,0.0004344096,0.001774605,0.0001427207,0.000005427245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3178269,0.003838237,0.6571105,0.0007940283,0.0001325199,0.0001489954,0.0001292537,0.0004867765,0.01953274],"genre_scores_gemma":[0.9906977,0.0008206742,0.006502955,0.00004080295,0.00004092813,0.00004508195,0.00003802085,0.00002655352,0.001787244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00531088,"threshold_uncertainty_score":0.01591283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158685876","doi":"10.1109/glocom.2005.1578267","title":"Delay limited optimal and suboptimal power and bit loading algorithms for OFDM systems over correlated fading channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Fading; Markov decision process; Computer science; Algorithm; Dynamic programming; Transmitter power output; Mathematical optimization; Transmission (telecommunications); Power (physics); Markov process; Mathematics; Telecommunications; Channel (broadcasting); Transmitter; Decoding methods","authors":[{"name":"Jahangir Hossain","is_ca":true},{"name":"D.V. Djonin","is_ca":true},{"name":"V.K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01959153959635459,"gpt":0.2583814134103958,"spread":0.2387898738140412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00175548,0.001090772,0.001008212,0.0006006422,0.0006014557,0.00116315,0.0007348424,0.001061956,0.001514093],"category_scores_gemma":[0.007080524,0.0006446759,0.0003321239,0.0007597078,0.001624663,0.001495806,0.001283376,0.001041593,0.0003557561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00142176,"about_ca_system_score_gemma":0.00212353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003812871,"about_ca_topic_score_gemma":0.003250941,"domain_scores_codex":[0.9991627,0.0003599533,0.00004321988,0.0000960788,0.000165886,0.0001721321],"domain_scores_gemma":[0.9959784,0.003188852,0.0003457608,0.0001393136,0.0002500586,0.00009763416],"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.0000986716,0.00003817369,0.0002786652,0.00003456608,0.00001422039,0.00002998868,0.00007435215,0.9623307,0.001043738,0.01291147,0.0004690747,0.02267646],"study_design_scores_gemma":[0.00001525143,0.00001855809,0.00004753968,0.000003555188,0.000003382927,0.000008218017,0.00001043743,0.9945914,0.0003348704,0.004883652,0.00007901528,0.000004075627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04425778,0.0004649658,0.9518067,0.0003119978,0.00002705107,0.00004877829,0.00003199782,0.0002455243,0.002805269],"genre_scores_gemma":[0.7930931,0.0004670058,0.2034649,0.0001722303,0.00004706329,0.0001646827,0.0000605783,0.00009127103,0.002439253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003812871,"threshold_uncertainty_score":0.01031566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103261319","doi":"10.1109/glocom.2005.1578422","title":"Comparison of modulation schemes and rake receiver structures for UWB systems on an IEEE 802.15.3 indoor channel","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Alberta","funders":"","keywords":"Intersymbol interference; Rake receiver; Rake; Computer science; Electronic engineering; Fading; Modulation (music); Interference (communication); Bit error rate; Pulse-position modulation; Channel (broadcasting); Ultra-wideband; Transmission (telecommunications); Computer network; Telecommunications; Engineering; Pulse-amplitude modulation; Physics; Acoustics","authors":[{"name":"Bo Hu","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03993643663742175,"gpt":0.309999410270099,"spread":0.2700629736326772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847264,0.0008317894,0.0007818554,0.0008905059,0.0005300549,0.0007483285,0.0006541577,0.0008925994,0.001343958],"category_scores_gemma":[0.0060858,0.0002968235,0.0004108736,0.0007765338,0.0003457082,0.0009825068,0.0003960572,0.0005339773,0.0003348004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005673008,"about_ca_system_score_gemma":0.0003464833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006291047,"about_ca_topic_score_gemma":0.001293746,"domain_scores_codex":[0.9986188,0.0006555835,0.00007791191,0.00007761231,0.0003697327,0.0002003194],"domain_scores_gemma":[0.994013,0.003926026,0.0004251397,0.0004581741,0.001094418,0.00008318319],"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.01205321,0.0006792669,0.01730305,0.00119497,0.000708417,0.0007042954,0.0007243693,0.3556994,0.2329066,0.01232264,0.001342718,0.364361],"study_design_scores_gemma":[0.0006458128,0.01433583,0.01896623,0.0002443979,0.001332358,0.002724864,0.0006333591,0.7198277,0.2317058,0.0043304,0.005007253,0.0002459742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8607551,0.003393014,0.1288782,0.0002306416,0.00008015837,0.0001392729,0.00009612548,0.0006132118,0.005814309],"genre_scores_gemma":[0.9738504,0.0007376481,0.02451796,0.00005106755,0.00003124145,0.00002776071,0.00005190193,0.00002830068,0.000703699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001847264,"threshold_uncertainty_score":0.00976938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109155742","doi":"10.1109/glocom.2005.1578476","title":"Minimum BER transmit optimization for two-input multiple-output spatial multiplexing","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Queen's University","funders":"","keywords":"Spatial multiplexing; MIMO; Beamforming; Transmitter; Phase-shift keying; Computer science; Multiplexing; Transmitter power output; Channel state information; Bit error rate; Precoding; Antenna (radio); Keying; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Engineering","authors":[{"name":"Neng Wang","is_ca":true},{"name":"Steven D. Blostein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04799855611514686,"gpt":0.3007162594522346,"spread":0.2527177033370877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009939702,0.000791044,0.0006051055,0.0003122256,0.0002935427,0.0006887062,0.0003783546,0.0006315771,0.001430435],"category_scores_gemma":[0.002622222,0.0003398024,0.0002668315,0.0005784844,0.0006882272,0.0007156514,0.0006380037,0.0004989114,0.0003322658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008132574,"about_ca_system_score_gemma":0.0005974766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007568287,"about_ca_topic_score_gemma":0.0007099136,"domain_scores_codex":[0.9994351,0.0002503755,0.00001680615,0.00005199757,0.000192513,0.00005311853],"domain_scores_gemma":[0.9990327,0.0006816167,0.0001118332,0.00005662288,0.0000980604,0.00001914292],"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.00009044394,0.00002835834,0.0002715618,0.00008405231,0.00002015713,0.0000582795,0.00007171284,0.9353387,0.00646843,0.03349791,0.0005899078,0.02348049],"study_design_scores_gemma":[0.000006295933,0.00002614369,0.00006147347,0.000004097607,0.000002866638,0.00001704488,0.000007800537,0.9911326,0.001337437,0.007176943,0.0002225189,0.000004735255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03600259,0.0004715915,0.9585549,0.0002754081,0.00002008006,0.00002380031,0.0000562233,0.000131133,0.004464318],"genre_scores_gemma":[0.8118383,0.0007023974,0.1818518,0.0001277959,0.00005265987,0.0001382744,0.00009801008,0.00007862618,0.005112243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001430435,"threshold_uncertainty_score":0.005900621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118673502","doi":"10.1109/glocom.2005.1578443","title":"High-rate codes over space, time, and frequency","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Queen's University","funders":"","keywords":"Block code; Orthogonal frequency-division multiplexing; Fading; MIMO; Decoding methods; Algorithm; Bit error rate; Computer science; MIMO-OFDM; Electronic engineering; Telecommunications","authors":[{"name":"Jinsong Wu","is_ca":true},{"name":"Steven D. Blostein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01249923772450163,"gpt":0.2537667481021,"spread":0.2412675103775984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579007,0.0005317134,0.0004627809,0.0007176214,0.0004788563,0.0007945487,0.0005795214,0.0006151918,0.001370374],"category_scores_gemma":[0.005222573,0.0002188564,0.0002706422,0.001287003,0.001079077,0.001420879,0.0007391347,0.0008159097,0.0004633729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007458531,"about_ca_system_score_gemma":0.0007207065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296981,"about_ca_topic_score_gemma":0.001341943,"domain_scores_codex":[0.9987675,0.0002719455,0.00004889609,0.000154702,0.0005885777,0.0001683694],"domain_scores_gemma":[0.994602,0.00303828,0.0006598114,0.0006792658,0.0009335292,0.00008713826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004954353,0.00008147138,0.002536718,0.0003670185,0.00005553333,0.0002887993,0.0005918386,0.2460235,0.04882905,0.4176904,0.001434444,0.2816058],"study_design_scores_gemma":[0.00009303141,0.0005591145,0.001538789,0.0001543665,0.00006137331,0.001201996,0.0001691517,0.8002179,0.05479805,0.1124175,0.0286651,0.0001237328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1186779,0.004701385,0.8607869,0.0004334621,0.0001213025,0.00006446232,0.0001184597,0.0003077323,0.01478851],"genre_scores_gemma":[0.8198093,0.003402163,0.1699272,0.0001859199,0.0002438533,0.0001559825,0.0001429117,0.00005726717,0.006075449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001370374,"threshold_uncertainty_score":0.005411506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136719960","doi":"10.1109/glocom.2005.1578045","title":"Performance comparison of layered coding and multiple description coding in packet networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","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":"Queen's University","funders":"","keywords":"Retransmission; Go-Back-N ARQ; Computer science; Automatic repeat request; Network packet; Hybrid automatic repeat request; Selective Repeat ARQ; Packet loss; Linear network coding; Computer network; Coding (social sciences); Multiple description coding; End-to-end delay; Transmission delay; Real-time computing; Algorithm; Mathematics; Statistics; Telecommunications link","authors":[{"name":"Yugang Zhou","is_ca":true},{"name":"Wai-Yip Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05215254175720044,"gpt":0.3130629905788054,"spread":0.260910448821605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00345809,0.0006681179,0.000665532,0.0009441966,0.0002988848,0.001150024,0.0008627113,0.0009145627,0.0008997632],"category_scores_gemma":[0.02081379,0.0002132477,0.0002762319,0.001000547,0.0006870829,0.001938583,0.001308908,0.0007003403,0.0001995064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001461619,"about_ca_system_score_gemma":0.001410308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005201513,"about_ca_topic_score_gemma":0.004165534,"domain_scores_codex":[0.9975595,0.0008789555,0.00009351,0.0001098331,0.00103588,0.0003222474],"domain_scores_gemma":[0.9810144,0.01302555,0.0007236791,0.001099292,0.00374874,0.0003884422],"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.003324493,0.0003669286,0.007044696,0.000343204,0.0002100982,0.0002006385,0.0002393938,0.701915,0.02658585,0.01907395,0.001694196,0.2390016],"study_design_scores_gemma":[0.00004038723,0.0005095678,0.0006994155,0.00001895691,0.00003509298,0.0000749203,0.0000382804,0.9837915,0.01227628,0.002167704,0.0003093112,0.00003865702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.708753,0.003700595,0.2761116,0.0006792721,0.0001635264,0.0001390078,0.0002940637,0.001328203,0.008830807],"genre_scores_gemma":[0.9685707,0.0005145239,0.02985149,0.00007891593,0.00002850962,0.00003781801,0.0001993072,0.00003739614,0.0006813705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005201513,"threshold_uncertainty_score":0.01828837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095649434","doi":"10.1109/glocom.2005.1578323","title":"Generalized feedback detection for MIMO systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"MIMO; Decoding methods; Detector; Computer science; Convolutional code; Computation; Algorithm; Tree (set theory); Multiplexing; Theoretical computer science; Mathematics; Channel (broadcasting); Telecommunications","authors":[{"name":"Tao Cui","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02758140841131319,"gpt":0.2807371188759759,"spread":0.2531557104646627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006496372,0.0006251328,0.0007827183,0.0004295945,0.0002806858,0.0006445266,0.0006599413,0.000672806,0.001082266],"category_scores_gemma":[0.001502195,0.000178874,0.0004246237,0.0005787605,0.0006722746,0.001084288,0.0008034218,0.0007463942,0.0002793305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006405798,"about_ca_system_score_gemma":0.0006662567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032033,"about_ca_topic_score_gemma":0.001339075,"domain_scores_codex":[0.9993374,0.0001864083,0.00002864274,0.0001190939,0.0002581801,0.00007036381],"domain_scores_gemma":[0.9995257,0.0002147093,0.00005060925,0.00007944099,0.0001103232,0.00001926435],"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.0001470504,0.00004156261,0.0005757391,0.0003809984,0.0000868398,0.0003404734,0.0001777579,0.357842,0.03143103,0.4055304,0.004348502,0.1990977],"study_design_scores_gemma":[0.00002014773,0.0001100711,0.0001686529,0.00002839375,0.00001780797,0.0001829758,0.00001812539,0.8803424,0.004239089,0.1081521,0.006688084,0.00003212127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005762718,0.0007892112,0.9918195,0.0001076009,0.00007720209,0.00001873811,0.00004004256,0.0001551969,0.00122977],"genre_scores_gemma":[0.5510625,0.002279315,0.4418999,0.0005100259,0.0003587444,0.0001407109,0.000192632,0.00005168642,0.003504468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001082266,"threshold_uncertainty_score":0.004647791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119573140","doi":"10.1109/glocom.2005.1578386","title":"Capacity-approaching semi-orthogonal space-time block codes","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"Block code; Linear code; Space–time block code; Circulant matrix; Concatenated error correction code; Mathematics; Computer science; Code word; Theoretical computer science; Algorithm; Discrete mathematics; Decoding methods","authors":[{"name":"Dũng Ngoc Đào","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0230636988904266,"gpt":0.2569245625404853,"spread":0.2338608636500587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008129896,0.0004049655,0.0005453385,0.0005273268,0.000353611,0.001078396,0.0005481267,0.0004879259,0.001802751],"category_scores_gemma":[0.004232306,0.0001872005,0.0002777613,0.0007548213,0.0008666014,0.001130455,0.001015556,0.0008599258,0.0005690549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007337438,"about_ca_system_score_gemma":0.001075191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219694,"about_ca_topic_score_gemma":0.000994873,"domain_scores_codex":[0.9990779,0.0002193861,0.0000286641,0.00007839593,0.000433494,0.0001620736],"domain_scores_gemma":[0.9974915,0.001213436,0.0002182094,0.0003357681,0.0006539821,0.00008717674],"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.0003152106,0.00004054424,0.0008210457,0.000175136,0.00004152905,0.0002598768,0.000193617,0.4347062,0.02121664,0.4381647,0.005335604,0.09873007],"study_design_scores_gemma":[0.00002504953,0.00006932424,0.0002264968,0.00002155388,0.000007950948,0.0002206141,0.00002559075,0.9125434,0.005563848,0.07658841,0.00468617,0.00002151363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1056132,0.001806126,0.8630437,0.0005771625,0.0001451936,0.00004813695,0.0002987437,0.000408776,0.02805898],"genre_scores_gemma":[0.9182215,0.001268211,0.0738669,0.000159065,0.000143635,0.0001046452,0.0002949364,0.00003978487,0.005901366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001802751,"threshold_uncertainty_score":0.006030798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110776229","doi":"10.1109/glocom.2005.1577688","title":"Spatio-ternporal schedulers in IEEE 802.16","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","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 Toronto","funders":"","keywords":"Computer science; Base station; Computer network; Wireless broadband; Telecommunications link; Wireless; Mobile broadband; Scheduling (production processes); Broadband; Backhaul (telecommunications); WiMAX; Broadband networks; Wireless network; IEEE 802; Real-time computing; Telecommunications; Engineering","authors":[{"name":"Sara Motahari","is_ca":true},{"name":"Ehsan Haghani","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01975152804339434,"gpt":0.2599854595244767,"spread":0.2402339314810823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003067392,0.0004521412,0.0003932589,0.0004096962,0.0007341936,0.001145737,0.001207906,0.0003203184,0.002502642],"category_scores_gemma":[0.004780333,0.0003469826,0.0002852991,0.0007683852,0.0006427731,0.001297683,0.0008423364,0.0007250718,0.0007907162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088233,"about_ca_system_score_gemma":0.002605889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004462203,"about_ca_topic_score_gemma":0.007889633,"domain_scores_codex":[0.9988361,0.000375239,0.0001212392,0.0001413068,0.0003527678,0.0001733987],"domain_scores_gemma":[0.9976783,0.0005867142,0.0003267488,0.0006524654,0.0006186137,0.000137245],"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.001347686,0.00037557,0.005132845,0.0002226766,0.000127207,0.0002852813,0.0003910153,0.4878206,0.01729861,0.163392,0.01056866,0.3130378],"study_design_scores_gemma":[0.0001451852,0.0003062874,0.0006482849,0.00002341587,0.00005241839,0.0001946495,0.00008721384,0.9500023,0.00718972,0.02480189,0.01650797,0.00004078744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05682194,0.001829006,0.930372,0.0005181811,0.000611629,0.0001978602,0.0001494581,0.001224059,0.008275756],"genre_scores_gemma":[0.7815973,0.000886325,0.2111155,0.0002701313,0.0002723228,0.0002288163,0.000189047,0.0001053328,0.005335308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004462203,"threshold_uncertainty_score":0.01622212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107330658","doi":"10.1109/glocom.2005.1578077","title":"Optimal rotations for quasi-orthogonal STBC with two-dimensional constellations","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"University of Alberta","funders":"","keywords":"Coding gain; Constellation; Space–time block code; Keying; Coding (social sciences); Mathematics; Phase-shift keying; Algorithm; Diversity gain; Block code; Euclidean distance; Rotation (mathematics); Quadrature amplitude modulation; Computer science; Topology (electrical circuits); Telecommunications; Combinatorics; Geometry; Fading; Physics; Decoding methods; Statistics; Bit error rate","authors":[{"name":"D.N. Dao","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02210624649553769,"gpt":0.286924863621591,"spread":0.2648186171260534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947651,0.0007364734,0.0004591724,0.0006660727,0.000316775,0.0009400311,0.0002791942,0.0004646174,0.001653891],"category_scores_gemma":[0.003356668,0.0003387573,0.0003144443,0.0009908925,0.001280359,0.00111031,0.0007878097,0.0004843901,0.0005976559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008510327,"about_ca_system_score_gemma":0.0007662493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007629003,"about_ca_topic_score_gemma":0.0007991121,"domain_scores_codex":[0.999218,0.0003118778,0.00003500767,0.00006096957,0.0002369602,0.0001372017],"domain_scores_gemma":[0.9989719,0.0005236914,0.000194253,0.0001323935,0.0001309868,0.00004676874],"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.000414095,0.00005461044,0.0007522164,0.0001480072,0.00003471022,0.0001370246,0.0001784581,0.6840396,0.03270666,0.2154479,0.001626798,0.06445989],"study_design_scores_gemma":[0.00009633846,0.0001590602,0.0004176089,0.00004077535,0.00001586428,0.0001602892,0.0000562913,0.8861086,0.01273366,0.09824005,0.001924466,0.00004693666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2067017,0.00175209,0.776164,0.0005795344,0.00007659267,0.00007412934,0.0002186953,0.0003505286,0.01408277],"genre_scores_gemma":[0.9262351,0.001157236,0.07089598,0.00007041627,0.00004932068,0.00007334622,0.0001195894,0.00004642705,0.001352442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001653891,"threshold_uncertainty_score":0.006174743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164938435","doi":"10.1109/glocom.2005.1577874","title":"Joint source-channel decoding of convolutionally encoded multiple-descriptions","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","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 Manitoba","funders":"","keywords":"Convolutional code; Computer science; Decoding methods; Viterbi decoder; Viterbi algorithm; Algorithm; Sequential decoding; Turbo code; Binary erasure channel; Soft output Viterbi algorithm; Channel (broadcasting); Serial concatenated convolutional codes; Theoretical computer science; Concatenated error correction code; Telecommunications; Channel capacity; Block code","authors":[{"name":"Pradeepa Yahampath","is_ca":true},{"name":"Upul Samarawickrama","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05186381459234656,"gpt":0.291604937948759,"spread":0.2397411233564124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198542,0.0006623499,0.0008209344,0.0004671361,0.0003777317,0.0009446137,0.0009432965,0.0009654509,0.001080941],"category_scores_gemma":[0.00562103,0.0004188136,0.0004078604,0.0007432448,0.0006993422,0.001473031,0.001314823,0.0009687213,0.0003493358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100078,"about_ca_system_score_gemma":0.001825947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003503594,"about_ca_topic_score_gemma":0.003833456,"domain_scores_codex":[0.9987118,0.0004619427,0.00007224319,0.0001258172,0.0004434341,0.0001846611],"domain_scores_gemma":[0.9966856,0.002126773,0.0002730695,0.0004071942,0.0004327938,0.00007454264],"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.000412655,0.00006558024,0.0009550232,0.0001198326,0.00006176301,0.0003739127,0.0001590284,0.8520412,0.01084874,0.07024612,0.0009133324,0.0638028],"study_design_scores_gemma":[0.00001497486,0.00003156458,0.00005674948,0.000007990188,0.000006002689,0.00006049713,0.00001140239,0.9799468,0.01034828,0.009127393,0.000376861,0.00001153032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06063905,0.0003289434,0.9360143,0.000187297,0.00003662489,0.00006181745,0.0001423719,0.0004061558,0.002183417],"genre_scores_gemma":[0.842872,0.0002183293,0.1526468,0.00007212525,0.0000207052,0.00006102515,0.0002484962,0.00005462351,0.003805861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003503594,"threshold_uncertainty_score":0.01050001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100245203","doi":"10.1109/glocom.2005.1578204","title":"Analysis of the outage probability for spatially correlated MIMO channels with receive antenna selection","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Concordia University","funders":"","keywords":"MIMO; Fading; Channel state information; Transmitter; Spatial correlation; Computer science; Antenna (radio); Channel (broadcasting); Signal-to-noise ratio (imaging); Selection (genetic algorithm); Antenna diversity; Topology (electrical circuits); Algorithm; Wireless; Telecommunications; Mathematics; Machine learning","authors":[{"name":"Hao Shen","is_ca":true},{"name":"Ali Ghrayeb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01900970044103999,"gpt":0.2494240987641517,"spread":0.2304143983231117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003091151,0.001158007,0.001456402,0.0009065442,0.0005656586,0.001186706,0.0009625371,0.0008312232,0.00272943],"category_scores_gemma":[0.01120438,0.000581139,0.0005952363,0.001457117,0.001417729,0.002003419,0.001340035,0.0008850583,0.0003953198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001800503,"about_ca_system_score_gemma":0.0008850309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754301,"about_ca_topic_score_gemma":0.00140331,"domain_scores_codex":[0.9978489,0.0007963912,0.00006855858,0.000161781,0.0007735603,0.0003508658],"domain_scores_gemma":[0.9853249,0.01179553,0.001188706,0.0005768707,0.0009283042,0.0001857513],"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.0000848745,0.00002155468,0.001628202,0.00008543754,0.00005441301,0.000349154,0.0001021474,0.9615489,0.001789868,0.02755099,0.0005995142,0.006184915],"study_design_scores_gemma":[0.000008790227,0.00003896032,0.001084321,0.00001570381,0.00002786791,0.0002143613,0.0000515943,0.9860436,0.0008220712,0.01139295,0.0002824977,0.00001727894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.166238,0.002563396,0.8172268,0.0007087571,0.00004296578,0.00005583961,0.0003833536,0.0003494142,0.01243141],"genre_scores_gemma":[0.982967,0.001344312,0.01309353,0.0001184211,0.0001016518,0.0000625647,0.0001718609,0.00005689876,0.00208395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003091151,"threshold_uncertainty_score":0.01634777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144575370","doi":"10.1109/glocom.2005.1577837","title":"Cooperative diversity using message passing in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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":"Decoding methods; Decodes; Relay; Computer science; Fading; Cooperative diversity; Relay channel; Channel (broadcasting); Computer network; Parity bit; Wireless; Node (physics); Algorithm; Telecommunications; Engineering","authors":[{"name":"J. P. K. Chu","is_ca":true},{"name":"Raviraj Adve","is_ca":true},{"name":"Edward S. Rogers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05801066960294587,"gpt":0.2999563723088912,"spread":0.2419457027059453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001875668,0.0006080284,0.0007294912,0.0007379449,0.0004632882,0.0008890379,0.0007919638,0.0009994345,0.0003587624],"category_scores_gemma":[0.003496489,0.0003192133,0.00034084,0.001163415,0.001325536,0.001386128,0.001098176,0.0007676464,0.0001474842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005103586,"about_ca_system_score_gemma":0.0004470967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007431159,"about_ca_topic_score_gemma":0.0005696874,"domain_scores_codex":[0.9989072,0.0005339534,0.00005311959,0.000112751,0.0003297892,0.00006319735],"domain_scores_gemma":[0.9980831,0.001181163,0.0002587665,0.000227949,0.0002068027,0.00004221959],"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.0001916651,0.00008347214,0.001068142,0.0003866742,0.0001342872,0.0002657188,0.000432979,0.6979809,0.01811237,0.1289746,0.001394713,0.1509745],"study_design_scores_gemma":[0.0000314392,0.0001716726,0.0001780486,0.00002546058,0.00003029669,0.00008683927,0.00002280957,0.9340659,0.00400824,0.05776253,0.003595066,0.00002167517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02825204,0.00307706,0.9657034,0.0003247734,0.0001198699,0.00005999963,0.00002373415,0.000342895,0.00209623],"genre_scores_gemma":[0.8889451,0.003361272,0.1044645,0.000133461,0.0002783576,0.0002064645,0.00006538835,0.00002937889,0.002516019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001875668,"threshold_uncertainty_score":0.009919584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164574966","doi":"10.1109/glocom.2005.1577849","title":"Exact evaluation of BER for arbitrary modulation and signaling in AWGN channel","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Modulation (music); Computer science; Additive white Gaussian noise; Symbol (formal); Bounding overwatch; Transmission (telecommunications); Constellation; Channel (broadcasting); Algorithm; Bit error rate; Quadrature amplitude modulation; Theoretical computer science; Electronic engineering; Telecommunications; Artificial intelligence; Engineering","authors":[{"name":"Leszek Szczeciński","is_ca":true},{"name":"Sonia Aı̈ssa","is_ca":true},{"name":"C. González","is_ca":false},{"name":"Marko Bacic","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04667697124037834,"gpt":0.3138617831009122,"spread":0.2671848118605338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017004,0.0005220273,0.0006890328,0.000395074,0.0002039906,0.0007192416,0.0004670595,0.0008464351,0.001221028],"category_scores_gemma":[0.007962037,0.0002271139,0.0002260086,0.0004384418,0.001047242,0.001402763,0.000828046,0.0006115722,0.000336254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006808206,"about_ca_system_score_gemma":0.00053106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001217732,"about_ca_topic_score_gemma":0.001252336,"domain_scores_codex":[0.999054,0.0003847061,0.00003108677,0.00005033129,0.0004040689,0.00007575638],"domain_scores_gemma":[0.9975832,0.001851587,0.0001533841,0.0002004296,0.0001817538,0.00002973423],"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.00005996444,0.00001250004,0.0002892479,0.00008994941,0.000008812828,0.00009276091,0.00007275605,0.929095,0.004621357,0.04856277,0.000299286,0.01679559],"study_design_scores_gemma":[0.000003762269,0.00001235295,0.0000927134,0.000009790559,0.000001761864,0.00003648212,0.00000843352,0.9864362,0.001277155,0.01194465,0.0001713303,0.000005322882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05989752,0.0009067084,0.9297942,0.0001914857,0.0000342119,0.00002016678,0.00005434821,0.0002841582,0.008817161],"genre_scores_gemma":[0.8704568,0.0009694994,0.1250796,0.00007576837,0.00002877928,0.0000454891,0.00007368823,0.0001116911,0.003158607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0017004,"threshold_uncertainty_score":0.008992672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168861763","doi":"10.1109/glocom.2005.1577804","title":"Recursive parameter estimation for the dynamic packet loss system","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Computer science; Quality of service; Packet loss; Multiprotocol Label Switching; Network packet; Provisioning; Computer network; Key (lock); Real-time computing","authors":[{"name":"Dongli Zhang","is_ca":true},{"name":"Dan Ionescu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01887969627661919,"gpt":0.2747423513485152,"spread":0.255862655071896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115101,0.0007906932,0.0008392584,0.0005687079,0.0003683388,0.0008942761,0.0007160474,0.0008038204,0.001754047],"category_scores_gemma":[0.00655831,0.0004764076,0.0004254926,0.0004290827,0.0005407028,0.0009643565,0.0006846135,0.001339389,0.0005617748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008546957,"about_ca_system_score_gemma":0.0008866079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01038378,"about_ca_topic_score_gemma":0.006746334,"domain_scores_codex":[0.9995548,0.000127439,0.00002255015,0.0001293295,0.0001127421,0.00005319663],"domain_scores_gemma":[0.998425,0.001064715,0.0001567327,0.00009985304,0.0002304298,0.00002331167],"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.0000729751,0.00002452832,0.0008143232,0.00006534014,0.00002838727,0.00004805105,0.00007669058,0.9445122,0.002467802,0.006245634,0.0004730543,0.04517087],"study_design_scores_gemma":[0.000003560996,0.000007809966,0.0001893078,0.000003070789,0.00000307369,0.00001043182,0.000003883111,0.9978422,0.0003572079,0.001396736,0.0001772531,0.000005485525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512644,0.0002032527,0.9833357,0.000120535,0.00001374774,0.00002450743,0.00004406565,0.0003705842,0.0007611244],"genre_scores_gemma":[0.865862,0.0005260201,0.1287884,0.00009564457,0.00003980448,0.0002345308,0.0003697327,0.0001254351,0.003958464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01038378,"threshold_uncertainty_score":0.02064669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168744335","doi":"10.1109/glocom.2005.1577693","title":"An analytical model for fair rate calculation in resilient packet rings","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Power Line Communications and Noise","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":"Carleton University","funders":"","keywords":"Computer science; Network packet; Node (physics); Convergence (economics); Reuse; Upstream (networking); Filter (signal processing); Computer network; Rate of convergence; Network congestion; Fairness measure; Channel (broadcasting); Throughput; Wireless; Telecommunications","authors":[{"name":"A. Shokrani","is_ca":true},{"name":"Ioannis Lambadaris","is_ca":true},{"name":"J. Talim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03906658592526484,"gpt":0.3138723955503759,"spread":0.274805809625111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001800068,0.0006890604,0.0008376457,0.000889631,0.0008912763,0.001447595,0.002502893,0.001705936,0.003223074],"category_scores_gemma":[0.006363784,0.0005826303,0.000763782,0.0007400883,0.001312323,0.002430575,0.00068972,0.001414225,0.001108884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002568458,"about_ca_system_score_gemma":0.001312598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004850768,"about_ca_topic_score_gemma":0.002053976,"domain_scores_codex":[0.9991338,0.0002266834,0.00003135828,0.0001455848,0.0003227326,0.0001399082],"domain_scores_gemma":[0.9983068,0.0009669724,0.0001835937,0.0001205149,0.0003768617,0.00004525662],"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.00003818675,0.00002700192,0.0001839092,0.0000415383,0.00001106116,0.000113947,0.0001389017,0.8660829,0.003122434,0.1231429,0.000775845,0.00632135],"study_design_scores_gemma":[0.000003154757,0.000006036375,0.00001631994,0.000003083567,0.000002301317,0.00001706415,0.000004055198,0.9941474,0.0002422368,0.005116563,0.0004373874,0.000004372325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008158042,0.0002372327,0.9855853,0.0002478997,0.00004878888,0.0000601246,0.00004215478,0.0002013739,0.005419077],"genre_scores_gemma":[0.7782775,0.001114004,0.1975559,0.0003405685,0.0001604487,0.0004622024,0.0001229308,0.000240338,0.02172627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004850768,"threshold_uncertainty_score":0.01863551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966984386","doi":"10.1109/glocom.2005.1577906","title":"Performance of space-time spreading in DS-CDMA systems over fast-fading channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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":"Concordia University","funders":"","keywords":"Fading; Computer science; Rayleigh fading; Multiuser detection; Block code; Code division multiple access; Transmit diversity; Single antenna interference cancellation; Detector; Minimum mean square error; Antenna diversity; Interference (communication); Algorithm; Transmitter; Diversity scheme; Spread spectrum; Electronic engineering; Telecommunications; Channel (broadcasting); Mathematics; Decoding methods; Wireless; Statistics; Engineering; Estimator","authors":[{"name":"Mohamed AlJerjawi","is_ca":true},{"name":"Walaa Hamouda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02914512207959,"gpt":0.2885284367801356,"spread":0.2593833147005455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134128,0.000913915,0.0005732721,0.0005673587,0.0005275792,0.001078705,0.0003282148,0.0009390854,0.0008456793],"category_scores_gemma":[0.008054997,0.0002231116,0.0002794975,0.0005595288,0.0008404576,0.0009964016,0.0008878705,0.0004413947,0.000217495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007771086,"about_ca_system_score_gemma":0.0007685969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002614663,"about_ca_topic_score_gemma":0.001739217,"domain_scores_codex":[0.9987367,0.0004853929,0.00004924364,0.00009770849,0.0004771655,0.0001537053],"domain_scores_gemma":[0.9941058,0.00391499,0.0005515884,0.0004203522,0.0008979801,0.0001094006],"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.0007766233,0.00006951227,0.008458727,0.0001364368,0.0001362999,0.0002552873,0.0002377386,0.9217255,0.03512098,0.01057157,0.0001716985,0.02233958],"study_design_scores_gemma":[0.00003371069,0.000422156,0.003584955,0.00001608346,0.00004753766,0.0002754486,0.00007239031,0.9705271,0.02065982,0.004088345,0.0002368484,0.00003560205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9006851,0.001096565,0.09258725,0.0001849619,0.00002820272,0.00003172375,0.00008774266,0.0002122687,0.005086126],"genre_scores_gemma":[0.9952894,0.0001642212,0.004142868,0.00001640591,0.000007446502,0.000007935982,0.00002488548,0.00001097986,0.0003357804],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002614663,"threshold_uncertainty_score":0.0112865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161700532","doi":"10.1109/glocom.2005.1578341","title":"Fano space-time multiple symbol differential detectors","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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":"Fano plane; Detector; Algorithm; Channel (broadcasting); Fading; Computer science; Decoding methods; Telecommunications; Mathematics","authors":[{"name":"P. Pun","is_ca":true},{"name":"P. Ho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01389451181453612,"gpt":0.2482813745676535,"spread":0.2343868627531174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008711,0.000697121,0.0005030402,0.0007842003,0.0004997615,0.0008745482,0.0006394321,0.0008486042,0.001621196],"category_scores_gemma":[0.001989313,0.0001892757,0.0002835277,0.0006622132,0.0006809066,0.001114785,0.0005737574,0.0006880787,0.0006006394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006007116,"about_ca_system_score_gemma":0.0005010752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004669404,"about_ca_topic_score_gemma":0.0009395217,"domain_scores_codex":[0.999311,0.0001707416,0.00003329633,0.0001183852,0.0002850164,0.00008146948],"domain_scores_gemma":[0.9992746,0.0002743274,0.00007973964,0.0001392647,0.0001940444,0.00003816642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008958435,0.0001303596,0.00650481,0.0003616099,0.000124648,0.0006559174,0.0002531698,0.09581588,0.09593193,0.2585301,0.008087019,0.5327087],"study_design_scores_gemma":[0.00005551115,0.0005021506,0.001243786,0.00005869876,0.00007751208,0.002148482,0.00003626071,0.7918997,0.1118491,0.03681443,0.05519935,0.00011499],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02193137,0.001424699,0.969341,0.0002533233,0.0001995954,0.00005115501,0.00007844093,0.0004422751,0.006278116],"genre_scores_gemma":[0.5682592,0.001028066,0.4215558,0.0004525165,0.0001818332,0.00007564208,0.0001765263,0.0000478206,0.008222522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001621196,"threshold_uncertainty_score":0.005423427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170974177","doi":"10.1109/glocom.2005.1578445","title":"GSECps: a diversity technique with improved performance-complexity tradeoff","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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 Victoria","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Diversity combining; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Computational complexity theory; Diversity scheme; Diversity (politics); Algorithm; Performance improvement; Scheme (mathematics); Diversity gain; Cooperative diversity; Telecommunications; Mathematics; Decoding methods; Engineering; Artificial intelligence","authors":[{"name":"Le Yang","is_ca":true},{"name":"Hong‐Chuan Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05732486372260757,"gpt":0.2757730914047872,"spread":0.2184482276821796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000654174,0.0009012665,0.0006274996,0.0005673563,0.0004502971,0.0008774963,0.0008900054,0.000683461,0.001378046],"category_scores_gemma":[0.00125088,0.0001989402,0.0003839144,0.001262491,0.0008111293,0.0009825863,0.001638772,0.001174726,0.0004095708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003430942,"about_ca_system_score_gemma":0.0005438998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003809651,"about_ca_topic_score_gemma":0.0008663899,"domain_scores_codex":[0.9992177,0.000223561,0.00002828153,0.00009459643,0.0003350775,0.0001007712],"domain_scores_gemma":[0.9990757,0.000339312,0.0001178215,0.0002558016,0.0001508237,0.0000606761],"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.0008295524,0.0002557975,0.00357694,0.0003278021,0.0003909275,0.0009476461,0.0003554327,0.09892667,0.2436433,0.09966665,0.006079223,0.545],"study_design_scores_gemma":[0.0004059029,0.002001842,0.003214021,0.00007704135,0.0002884634,0.005097336,0.0002009222,0.7337107,0.1681326,0.05468312,0.0320397,0.0001483655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07031814,0.001283156,0.9189304,0.000470661,0.0001104371,0.0001090576,0.00007034282,0.0005958459,0.008112029],"genre_scores_gemma":[0.6923143,0.0009802093,0.3021139,0.0004695544,0.0002677884,0.0001175301,0.0001615817,0.00003714359,0.003537949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001378046,"threshold_uncertainty_score":0.004610062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021856733","doi":"10.1109/glocom.2005.1578050","title":"A vector-hydrophone~s minimal composition for finite estimation-variance in direction-finding near a rigid reflecting boundary","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Direction-of-Arrival Estimation 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 Waterloo","funders":"","keywords":"Hydrophone; Acoustics; Underwater; Boundary (topology); Underwater acoustics; Sound pressure; Geology; Mathematics; Physics; Mathematical analysis","authors":[{"name":"Javad Ahmadi‐Shokouh","is_ca":true},{"name":"Hengameh Keshavarz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03939539621145125,"gpt":0.3371166400447648,"spread":0.2977212438333135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102481,0.0005730377,0.0005472727,0.0003409214,0.0003283848,0.0004104936,0.0004517895,0.0003960236,0.001060132],"category_scores_gemma":[0.003906588,0.000410862,0.0003225807,0.0002969384,0.0007326901,0.0007798006,0.001209731,0.0006790232,0.0003067138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002350798,"about_ca_system_score_gemma":0.0007012408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005257835,"about_ca_topic_score_gemma":0.0006700328,"domain_scores_codex":[0.999342,0.0002832561,0.00002668127,0.0001000233,0.0002066236,0.0000413868],"domain_scores_gemma":[0.9989836,0.0006038088,0.00009740521,0.0001076385,0.0001451638,0.0000623602],"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.0008012664,0.0001463956,0.002603432,0.000320854,0.0000672516,0.0002546067,0.000289487,0.3392609,0.2372757,0.1612712,0.001403351,0.2563054],"study_design_scores_gemma":[0.0000214906,0.0002050822,0.0006224589,0.00001697674,0.00001943811,0.0001547511,0.0000299079,0.9419566,0.0272266,0.02823154,0.001492596,0.00002249589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02399521,0.00003584879,0.9752484,0.00003791752,0.000006759468,0.0000166581,0.00001996591,0.00007432519,0.0005648332],"genre_scores_gemma":[0.3380112,0.000106784,0.660163,0.00002892067,0.00002101857,0.0000938032,0.0001229669,0.00007252539,0.001379698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001060132,"threshold_uncertainty_score":0.005419791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103621885","doi":"10.1109/glocom.2005.1578005","title":"A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"graph theory and CDMA systems","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":"Greedy algorithm; Algorithm; Reuse; Computer science; Code (set theory); Set (abstract data type); Process (computing); Reduction (mathematics); Mathematics; Engineering","authors":[{"name":"Tamer Khattab","is_ca":true},{"name":"Hussein Alnuweiri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03087476027758857,"gpt":0.2722429596859024,"spread":0.2413681994083138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594917,0.0005127569,0.000404575,0.0007123611,0.0005982253,0.0005964462,0.0009594173,0.0006176329,0.001316881],"category_scores_gemma":[0.002025117,0.0002981309,0.0005270957,0.0006701895,0.0006934429,0.0007536684,0.001157526,0.0008249611,0.0006632177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005514068,"about_ca_system_score_gemma":0.001063007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006379882,"about_ca_topic_score_gemma":0.0008986741,"domain_scores_codex":[0.999278,0.0001837312,0.00003986385,0.0001064475,0.0003134142,0.00007845696],"domain_scores_gemma":[0.9992185,0.0003542944,0.00007686726,0.0001490268,0.0001671247,0.00003424223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003307572,0.0001463229,0.0009499667,0.0001575925,0.00007994125,0.0002004379,0.0002608938,0.2243509,0.05346359,0.1429716,0.003386436,0.5737016],"study_design_scores_gemma":[0.0001226321,0.0002224513,0.0002813842,0.00003251027,0.00003940708,0.0005182367,0.00006454129,0.8742253,0.04089144,0.07018948,0.01334696,0.00006563254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007451967,0.00004445732,0.9911512,0.0000413306,0.0000171852,0.0000448196,0.00001748846,0.0001516411,0.001079884],"genre_scores_gemma":[0.06820013,0.00007182888,0.9299037,0.00005258662,0.00001784843,0.0001194775,0.00009783961,0.000051959,0.001484488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001316881,"threshold_uncertainty_score":0.004405379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126425467","doi":"10.1109/glocom.2005.1577779","title":"Using feedback control to manage QoS for clusters of servers providing service differentiation","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Distributed and Parallel Computing Systems","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":"Western University","funders":"","keywords":"Server; Computer science; Quality of service; Control (management); Distributed computing; Service (business); Service level; Computer network; File server; Artificial intelligence","authors":[{"name":"Wael Hosny Fouad Aly","is_ca":true},{"name":"Hanan Lutfiyya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04918237558252242,"gpt":0.2991411786468079,"spread":0.2499588030642855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008972398,0.0004215522,0.0003230334,0.0003264579,0.0004829719,0.0006819919,0.0008605152,0.0004122566,0.0007545754],"category_scores_gemma":[0.002181103,0.0001885408,0.0002389742,0.0002303955,0.0005849927,0.0007613309,0.000517039,0.0004877386,0.0001074335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007416751,"about_ca_system_score_gemma":0.0005421669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001973518,"about_ca_topic_score_gemma":0.001427089,"domain_scores_codex":[0.999448,0.0001008105,0.00003050546,0.0001008226,0.0002525987,0.00006724222],"domain_scores_gemma":[0.9991125,0.0004141215,0.0001235868,0.0000982535,0.0002013137,0.00005020346],"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.001170428,0.0006215544,0.002394993,0.0002879326,0.0000960797,0.0003283418,0.0007754918,0.3486703,0.2705958,0.02287598,0.001707484,0.3504755],"study_design_scores_gemma":[0.00007968819,0.000629031,0.0006316191,0.00001269465,0.00003101986,0.0000854411,0.00006407396,0.9485418,0.04154918,0.005946369,0.002398351,0.0000306898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.164541,0.0006516856,0.8298508,0.0003269623,0.0001867093,0.0001042423,0.00001903797,0.001486368,0.002833232],"genre_scores_gemma":[0.9627284,0.0001242857,0.03608495,0.00008036458,0.0000456527,0.00003892163,0.00001552489,0.0000193366,0.0008625245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001973518,"threshold_uncertainty_score":0.005381286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164638100","doi":"10.1109/glocom.2005.1577871","title":"Performance of the successive coding strategy in the CEO problem","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Concordia University","funders":"","keywords":"Wireless sensor network; Distortion (music); Rate distortion; Gaussian; Coding (social sciences); Upper and lower bounds; Rate–distortion theory; Computer science; Algorithm; Mathematics; Mathematical optimization; Statistics; Telecommunications; Computer network; Physics","authors":[{"name":"Hamid Behroozi","is_ca":true},{"name":"M. Reza Soleymani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02342508297852596,"gpt":0.2628776841207789,"spread":0.2394526011422529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004828281,0.001489016,0.001784854,0.00081006,0.0006513874,0.001772097,0.001420671,0.001751839,0.002744953],"category_scores_gemma":[0.02077602,0.0003805592,0.0006479902,0.000896481,0.002074937,0.002719884,0.002528256,0.00145332,0.0003653421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00168745,"about_ca_system_score_gemma":0.003105529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004578239,"about_ca_topic_score_gemma":0.001944763,"domain_scores_codex":[0.9976442,0.001121603,0.00006517339,0.0002458755,0.0004191609,0.0005040031],"domain_scores_gemma":[0.9827617,0.01414304,0.0008667924,0.0006277718,0.0009427562,0.0006579566],"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.001072691,0.0001542646,0.001051434,0.0002246652,0.00007365867,0.0001820863,0.0001452813,0.8973718,0.003394127,0.06815722,0.002521702,0.02565106],"study_design_scores_gemma":[0.0001000755,0.0002020192,0.0002147169,0.00001989021,0.00001507414,0.00008772715,0.00006139446,0.9772562,0.001562024,0.02015797,0.0003032546,0.00001957149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3724606,0.003018993,0.5887948,0.002952921,0.0002092851,0.0002259738,0.0003948453,0.0005696077,0.03137296],"genre_scores_gemma":[0.9700814,0.0007820104,0.02622577,0.000239807,0.00007184227,0.00008232352,0.0002034449,0.00006703453,0.002246384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004828281,"threshold_uncertainty_score":0.02553469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151901300","doi":"10.1109/glocom.2005.1578453","title":"Frequency domain channel estimation for SC-FDE in UWB communications","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 Victoria","funders":"","keywords":"SC-FDE; Estimator; Channel (broadcasting); Frequency domain; Computer science; Transmission (telecommunications); Ultra-wideband; Equalization (audio); Algorithm; Upper and lower bounds; Minimum mean square error; Mean squared error; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics","authors":[{"name":"Yue Wang","is_ca":true},{"name":"Xiaodai Dong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02502145290885426,"gpt":0.2772138634489533,"spread":0.252192410540099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570765,0.0003465242,0.0004953605,0.0003036561,0.0003155933,0.0005394837,0.0002550161,0.0005624322,0.001253375],"category_scores_gemma":[0.004823684,0.0002444145,0.0001684496,0.0003689778,0.0005216326,0.0006286064,0.0004294274,0.0006506997,0.0003070183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003632377,"about_ca_system_score_gemma":0.0008910028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058637,"about_ca_topic_score_gemma":0.001620506,"domain_scores_codex":[0.9996112,0.0001488824,0.00001559876,0.00004601428,0.0001500607,0.00002828495],"domain_scores_gemma":[0.9983125,0.001170307,0.0001140364,0.0001538516,0.0002318433,0.00001753588],"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.000278207,0.00006049577,0.001159884,0.000250897,0.00005580678,0.0001880729,0.0001000402,0.6791832,0.04751803,0.03503895,0.002994412,0.233172],"study_design_scores_gemma":[0.00001282895,0.00004843333,0.0003864739,0.00001991557,0.000009720314,0.0001016738,0.00001423829,0.9830981,0.009231141,0.005463239,0.001599951,0.00001427284],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01499717,0.0005296706,0.9832533,0.0001676127,0.00003364175,0.0000114871,0.00002316918,0.0001554182,0.0008284284],"genre_scores_gemma":[0.5873257,0.001844274,0.4077702,0.0001575156,0.0001443809,0.00009502482,0.0001824603,0.00004446289,0.002436113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001253375,"threshold_uncertainty_score":0.004192948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103967031","doi":"10.1109/glocom.2005.1578334","title":"Exploiting spatial diversity in rate adaptive WLANs with relay infrastructure","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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":"York University; University of Toronto","funders":"","keywords":"Relay; Computer network; Throughput; Rayleigh fading; Computer science; Fading; Antenna diversity; Wireless; Diversity gain; Wireless network; Wi-Fi; Telecommunications; Channel (broadcasting)","authors":[{"name":"Aaron So","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04221403381932609,"gpt":0.2683632542098175,"spread":0.2261492203904914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438896,0.0005175928,0.0004380475,0.0005609572,0.0003238669,0.0008113396,0.0006165025,0.0004482955,0.0004871127],"category_scores_gemma":[0.00423731,0.0003893317,0.0003442043,0.000560128,0.001113326,0.001274663,0.0007095017,0.0003770854,0.0001523728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007450173,"about_ca_system_score_gemma":0.0004052922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255654,"about_ca_topic_score_gemma":0.00105647,"domain_scores_codex":[0.999353,0.0002941609,0.00001828851,0.00005590666,0.000136055,0.0001425343],"domain_scores_gemma":[0.997093,0.00202258,0.0003389761,0.0002470814,0.000234401,0.00006396003],"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.0001911283,0.00005171838,0.001670253,0.00005664482,0.000064361,0.0004088811,0.0001585902,0.9219027,0.03431473,0.02233224,0.0001941761,0.01865476],"study_design_scores_gemma":[0.00001499324,0.0001257935,0.0004358174,0.000006294387,0.00004048409,0.0001583667,0.00004690879,0.9835446,0.007891689,0.007448611,0.000268858,0.00001761401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.519349,0.0009197974,0.4734746,0.0001934932,0.00002172486,0.00002835919,0.00003403167,0.0004348363,0.005544142],"genre_scores_gemma":[0.9947648,0.0001758444,0.004786325,0.00001254615,0.00001173533,0.000009157032,0.000005804909,0.000008518288,0.0002252099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001438896,"threshold_uncertainty_score":0.007609725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099120675","doi":"10.1109/glocom.2005.1577846","title":"Optimal packet scheduling over correlated Nakagami-m channels with different diversity-combining techniques","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","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 British Columbia","funders":"","keywords":"Nakagami distribution; Computer science; Fading; Network packet; Scheduling (production processes); Markov process; Bit error rate; Markov decision process; Markov chain; Transmission (telecommunications); Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Computer network; Telecommunications; Statistics","authors":[{"name":"Ashok Karmokar","is_ca":true},{"name":"V.K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01482366636108302,"gpt":0.2399280109414401,"spread":0.2251043445803571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168104,0.0009050071,0.001005792,0.0004271287,0.0004045858,0.001202367,0.0006597998,0.0006762245,0.0007940585],"category_scores_gemma":[0.003128041,0.0006176964,0.0004864621,0.0008930145,0.0008213079,0.001030285,0.0007064258,0.0005662336,0.0001299941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001645596,"about_ca_system_score_gemma":0.001705203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003434467,"about_ca_topic_score_gemma":0.002701708,"domain_scores_codex":[0.9992705,0.0003292619,0.0000236063,0.00007743436,0.0001248469,0.0001743511],"domain_scores_gemma":[0.9979483,0.001390816,0.0003048065,0.00007461631,0.0001814622,0.0001000145],"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.00005326573,0.00002177723,0.0002333342,0.00002612996,0.00001748768,0.00002987201,0.00002032313,0.9907336,0.00120888,0.004659808,0.0001437393,0.002851757],"study_design_scores_gemma":[0.00001310326,0.00003127732,0.0001101729,0.000002051951,0.00000896183,0.000005939852,0.000008480157,0.9974746,0.0004775813,0.001811873,0.00005147904,0.000004362564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2089213,0.001266358,0.7848046,0.00048385,0.00008268092,0.00006894605,0.0001172562,0.0001269266,0.004128186],"genre_scores_gemma":[0.9624623,0.0005278343,0.03584804,0.00005416788,0.00004246515,0.00004413529,0.00003505716,0.00002861746,0.0009573855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003434467,"threshold_uncertainty_score":0.0119397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115248402","doi":"10.1109/glocom.2005.1577728","title":"On optimizing token bucket parameters at the network edge under generalized processor sharing (GPS) scheduling","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","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":"University of Manitoba","funders":"","keywords":"Token bucket; Leaky bucket; Bounding overwatch; Computer science; Security token; Scheduling (production processes); Traffic shaping; Generalized processor sharing; Mathematical optimization; Computer network; Mathematics; Dynamic priority scheduling; Network traffic control; Quality of service; Round-robin scheduling","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Jeffrey E. Diamond","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03630965501397243,"gpt":0.2765649439790216,"spread":0.2402552889650492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556603,0.0007851944,0.0009424588,0.000465333,0.0003617811,0.001039914,0.000903374,0.0008421066,0.001347781],"category_scores_gemma":[0.00537264,0.0003346172,0.0002197104,0.001000503,0.0008219841,0.002233464,0.0008567676,0.0006417505,0.000156292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186865,"about_ca_system_score_gemma":0.001194435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002808613,"about_ca_topic_score_gemma":0.002039162,"domain_scores_codex":[0.9994543,0.0002208088,0.00001442116,0.00007752361,0.00008301593,0.0001499171],"domain_scores_gemma":[0.9982323,0.001327432,0.0001792445,0.00007752088,0.0001151167,0.00006851458],"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.00007677051,0.00001236963,0.000159522,0.00002086939,0.000005146532,0.0000149079,0.00001481245,0.9864057,0.0009660609,0.003598862,0.0001462001,0.008578822],"study_design_scores_gemma":[0.00000974269,0.0000216575,0.00005578291,0.000002679171,0.000003837727,0.000004934968,0.00001695095,0.9958323,0.0006818396,0.003239836,0.0001268055,0.000003733528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1919027,0.0006172642,0.8036173,0.0002390183,0.00003182962,0.00006449484,0.00006382589,0.0002151428,0.00324857],"genre_scores_gemma":[0.93922,0.0003270224,0.0591997,0.0000456179,0.00001812735,0.00004256267,0.00004575209,0.00006494937,0.001036335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002808613,"threshold_uncertainty_score":0.008611321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131143723","doi":"10.1109/glocom.2005.1578458","title":"Support of multimedia SIP applications in mobile ad hoc networks: service discovery and networking architecture","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Mobile Ad Hoc 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":"Communications Research Centre Canada","funders":"","keywords":"Session Initiation Protocol; Computer science; Computer network; SIP trunking; Mobile ad hoc network; Service discovery; Session (web analytics); Service layer; Wireless ad hoc network; Voice over IP; The Internet; Quality of service; Server; World Wide Web; Telecommunications; Web service; Wireless","authors":[{"name":"Li Li","is_ca":true},{"name":"Louise Lamont","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01426305536760944,"gpt":0.2592723045023577,"spread":0.2450092491347483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285384,0.000363418,0.000243647,0.0003691841,0.000494316,0.001061326,0.0006399875,0.0006420616,0.0008257838],"category_scores_gemma":[0.0008399785,0.0001605134,0.0001438086,0.0004203734,0.0003768476,0.00111417,0.0003963722,0.0004529888,0.0004584411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004337731,"about_ca_system_score_gemma":0.0006058704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004428333,"about_ca_topic_score_gemma":0.0008025927,"domain_scores_codex":[0.9996836,0.0001121806,0.00002122803,0.00002441927,0.000130672,0.00002786931],"domain_scores_gemma":[0.9996201,0.0000802303,0.00003524957,0.00005701331,0.0001734833,0.00003384366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000638051,0.0004107845,0.0034726,0.0007658178,0.00008424125,0.0007333585,0.0006585731,0.06322841,0.2133576,0.1883071,0.01272994,0.5156136],"study_design_scores_gemma":[0.0000677565,0.0008108463,0.002283152,0.0001247105,0.0001523248,0.00165583,0.0002261962,0.7746114,0.07729742,0.05095746,0.09174016,0.00007274329],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1297679,0.005773485,0.821392,0.001370814,0.0002771085,0.0002725666,0.00007186279,0.002914458,0.03815988],"genre_scores_gemma":[0.6824269,0.004614421,0.2987667,0.0003589535,0.000258141,0.0002846237,0.0002654604,0.0001410309,0.01288375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001061326,"threshold_uncertainty_score":0.004910648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162541252","doi":"10.1109/glocom.2005.1577845","title":"BER analysis of BPSK signaling in Ricean-faded cochannel interference","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 Alberta","funders":"","keywords":"Phase-shift keying; Bit error rate; Interference (communication); Fading; Computer science; SIGNAL (programming language); Saddle point; Algorithm; Demodulation; Word error rate; Adjacent-channel interference; Mathematics; Channel (broadcasting); Telecommunications; Electronic engineering; Speech recognition; Engineering","authors":[{"name":"Zheng Du","is_ca":true},{"name":"Julian Cheng","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02552327861550993,"gpt":0.2866920819322841,"spread":0.2611688033167742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335679,0.0008543375,0.0007946721,0.0007279325,0.0004042799,0.000737352,0.0006138924,0.0009837112,0.001308498],"category_scores_gemma":[0.005006558,0.0003115512,0.000419306,0.0008064439,0.001263127,0.0007239566,0.0005671105,0.0006638124,0.0004369733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416143,"about_ca_system_score_gemma":0.0006034698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002640691,"about_ca_topic_score_gemma":0.00102724,"domain_scores_codex":[0.9991041,0.000285818,0.00002313717,0.00006811335,0.0004135314,0.0001053277],"domain_scores_gemma":[0.9974783,0.001665079,0.0001988203,0.0001451081,0.0004736882,0.00003901687],"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.0002193036,0.00002124399,0.001021417,0.0001403333,0.00004140122,0.0003065868,0.0002513189,0.9246717,0.01560235,0.04432096,0.0006184739,0.01278494],"study_design_scores_gemma":[0.000003520172,0.00002797071,0.0005059037,0.00001360953,0.000007857769,0.0000891797,0.00002124096,0.9919072,0.00175253,0.005482274,0.0001753448,0.00001337853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.257954,0.00233206,0.7212247,0.0006016568,0.00008507208,0.00003396339,0.0001522083,0.0008349601,0.01678132],"genre_scores_gemma":[0.9847065,0.0007048239,0.01209627,0.00005773947,0.00002705062,0.00002196672,0.00005501857,0.0000538776,0.002276794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002640691,"threshold_uncertainty_score":0.01027489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141338028","doi":"10.1109/glocom.2005.1577786","title":"Call level service differentiation for efficient SLA management","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","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":"University of Waterloo; University of Toronto","funders":"","keywords":"Service-level agreement; Computer science; Bandwidth (computing); Quality of service; Service level; Computer network; Preemption; Shared resource; Differentiated services; Service (business); Distributed computing; Operating system; Business","authors":[{"name":"Yu Cheng","is_ca":true},{"name":"Weihua Zhuang","is_ca":true},{"name":"Alberto Leon‐Garcia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0342926737733683,"gpt":0.2707770062553197,"spread":0.2364843324819514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229167,0.000447786,0.0005368796,0.0004603779,0.0008440575,0.001499356,0.001356992,0.0007213394,0.003582656],"category_scores_gemma":[0.003820338,0.0002637875,0.0003709762,0.0005516252,0.000730761,0.001556172,0.00147466,0.002377478,0.001291825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050063,"about_ca_system_score_gemma":0.001379608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001101983,"about_ca_topic_score_gemma":0.001197967,"domain_scores_codex":[0.998266,0.000521703,0.0001004981,0.000171171,0.0006954429,0.0002450537],"domain_scores_gemma":[0.9982165,0.0006091211,0.0001833067,0.0004797533,0.0003838938,0.0001274791],"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.0003524339,0.0003282735,0.001002198,0.0003143414,0.00006140325,0.0003988518,0.0005971812,0.1367356,0.1092689,0.4188145,0.009649506,0.3224767],"study_design_scores_gemma":[0.00006347291,0.0001539552,0.0004305945,0.00004988298,0.00003277376,0.000311388,0.00008277725,0.8792657,0.01751816,0.06304491,0.03899276,0.00005358986],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01629948,0.0006022757,0.9732983,0.0004987225,0.0002100522,0.0001165061,0.00002930235,0.00097172,0.007973623],"genre_scores_gemma":[0.6605899,0.0004836134,0.3335934,0.0003869497,0.0002326888,0.0001384144,0.0001057823,0.0001213823,0.004347961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003582656,"threshold_uncertainty_score":0.01198518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154024803","doi":"10.1109/glocom.2005.1577941","title":"A self-encryption authentication protocol with identity anonymity for teleconference services","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":2,"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":"Pseudonym; Anonymity; Computer science; Authentication (law); Computer security; Identity (music); Computer network; Encryption; Protocol (science); Teleconference; Telecommunications; Political science","authors":[{"name":"Yixin Jiang","is_ca":false},{"name":"Chuang Lin","is_ca":false},{"name":"Mingshui Shi","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02218616053675447,"gpt":0.3209357107142334,"spread":0.298749550177479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001175015,0.0005395691,0.0006924424,0.0006984264,0.001294504,0.00134212,0.001453963,0.001347924,0.001883041],"category_scores_gemma":[0.001613653,0.0003330082,0.0008381639,0.000861203,0.0009253228,0.004034225,0.002018388,0.001643573,0.001028055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004922729,"about_ca_system_score_gemma":0.0009613484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002247568,"about_ca_topic_score_gemma":0.0002409666,"domain_scores_codex":[0.9984273,0.0003920652,0.0002156781,0.0001736414,0.0006218218,0.0001695925],"domain_scores_gemma":[0.9988554,0.0002233137,0.0001790718,0.0002921027,0.0003812533,0.00006893063],"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.0005475759,0.0003751362,0.001229161,0.001071593,0.0001735995,0.002689735,0.00085219,0.01437904,0.1562809,0.5965936,0.01323976,0.2125676],"study_design_scores_gemma":[0.0003664184,0.00124937,0.001634705,0.0001797864,0.0004271652,0.01096268,0.0004013143,0.5028121,0.1577079,0.1302875,0.1936301,0.0003411183],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02017915,0.0009528052,0.9703361,0.0005073369,0.0003827736,0.0003011376,0.00007972575,0.000818938,0.006442119],"genre_scores_gemma":[0.6032115,0.001594629,0.3773001,0.0005037259,0.0004141193,0.0008519845,0.0003739163,0.0001278691,0.01562217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001883041,"threshold_uncertainty_score":0.006299376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144433150","doi":"10.1109/glocom.2005.1578390","title":"On distributed space-time filtering","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"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":"Node (physics); Computer science; Channel (broadcasting); Relation (database); Filter (signal processing); Algorithm; Grassmannian; Upper and lower bounds; Optimization problem; Wireless; Topology (electrical circuits); Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Telecommunications; Engineering; Data mining","authors":[{"name":"Simon Yiu","is_ca":true},{"name":"Robert Schober","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03322163927317642,"gpt":0.2843909355407304,"spread":0.2511692962675539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00152158,0.0009127903,0.0007350522,0.0005631912,0.0004154211,0.001111571,0.0006971393,0.001235344,0.002164918],"category_scores_gemma":[0.003476407,0.0002771674,0.0004623697,0.001105855,0.001683578,0.001606521,0.001241524,0.001119932,0.000697781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008890909,"about_ca_system_score_gemma":0.000640076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009793208,"about_ca_topic_score_gemma":0.0008896658,"domain_scores_codex":[0.9986046,0.0004550115,0.0000599543,0.0002108619,0.000551083,0.0001184456],"domain_scores_gemma":[0.9983009,0.0009785045,0.0001095703,0.0002655082,0.0002993413,0.00004624351],"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.0001848693,0.00004720008,0.0004511853,0.0001418953,0.00005057772,0.00009247374,0.0001493308,0.3300385,0.01232066,0.5036167,0.003350209,0.1495564],"study_design_scores_gemma":[0.00003043292,0.0001163824,0.0001802079,0.00002923795,0.00001475327,0.00009010777,0.00002243199,0.8574938,0.004092114,0.1291143,0.008793293,0.0000229329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002777722,0.0003874018,0.9942028,0.0001528802,0.00005142962,0.000009183587,0.00001203143,0.00003308875,0.002373428],"genre_scores_gemma":[0.5813614,0.004726957,0.3959831,0.0005803877,0.0008993305,0.0002554983,0.0002221644,0.0001151246,0.01585615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002164918,"threshold_uncertainty_score":0.008046925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}