{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005997866,0.0005239575,0.0004593244,0.0002983041,0.000876473,0.0006717335,0.003296524,0.0003138493,0.00001755243],"category_scores_gemma":[0.00001821416,0.0004307158,0.0001331516,0.00245408,0.0003121061,0.0009992503,0.0004951206,0.0006387899,0.00005769556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009496606,"about_ca_system_score_gemma":0.0005624507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000789813,"about_ca_topic_score_gemma":0.009568667,"domain_scores_codex":[0.996327,0.000451505,0.0009063973,0.0005813413,0.0006515971,0.001082184],"domain_scores_gemma":[0.9959156,0.0002334095,0.000516274,0.002584751,0.0005125483,0.0002374007],"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.00003246756,0.0002532204,0.0001134641,0.000003318742,0.00003035035,0.000001829356,0.0002260487,0.8927593,0.00001372918,0.07018202,0.007632446,0.02875187],"study_design_scores_gemma":[0.0009224525,0.00006306512,0.0005640807,0.0000588099,0.00002076437,0.00007688154,0.0001177994,0.9816415,0.0001127076,0.0001286963,0.01578129,0.0005119097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03650089,0.00019557,0.9364772,0.007646608,0.0003266166,0.0004894352,0.00002236553,0.000426582,0.01791471],"genre_scores_gemma":[0.9535692,0.0004635026,0.04367183,0.001580525,0.00008481232,0.0001879553,0.00008360409,0.00002024541,0.0003383628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9170683,"threshold_uncertainty_score":0.9998145,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007643453,0.0008073986,0.0008122455,0.0003112064,0.0005940523,0.0006074886,0.00559292,0.0005401907,0.0001511383],"category_scores_gemma":[0.00003973686,0.0008895923,0.0002762551,0.001617829,0.0003593618,0.0006634085,0.001218429,0.001009185,0.0003626207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277377,"about_ca_system_score_gemma":0.0004949612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003719243,"about_ca_topic_score_gemma":0.004370521,"domain_scores_codex":[0.9937972,0.0007275383,0.001516725,0.001299572,0.0007535139,0.001905399],"domain_scores_gemma":[0.9941426,0.0003096796,0.0005226097,0.004076256,0.0003980802,0.0005507842],"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.00003850001,0.0006807945,0.0006036523,0.000006994037,0.00006945165,0.00004283764,0.0001276859,0.9615576,0.00005752298,0.007407601,0.006894989,0.02251235],"study_design_scores_gemma":[0.001394387,0.0001106002,0.0005863921,0.0001372418,0.00002579343,0.0002383462,0.00006277973,0.9634396,0.0003005498,0.00003525015,0.03274284,0.0009262518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1211526,0.001383344,0.8526413,0.005848751,0.001176127,0.0009725785,0.0000630492,0.0009595037,0.01580271],"genre_scores_gemma":[0.7922203,0.001204525,0.2042023,0.001362529,0.0001890509,0.0001398735,0.00008995806,0.00004321232,0.000548223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6710677,"threshold_uncertainty_score":0.9997873,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003669766,0.0006836803,0.0007904543,0.0001635907,0.0006390926,0.0002229876,0.001026173,0.0004602801,0.00005663908],"category_scores_gemma":[0.00008230063,0.0008043111,0.0001688623,0.0006682728,0.000436101,0.0008634228,0.0001190935,0.0006921151,0.00006742303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007013607,"about_ca_system_score_gemma":0.0001638281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006492568,"about_ca_topic_score_gemma":0.0004594185,"domain_scores_codex":[0.9967887,0.000183944,0.0009254439,0.0006871099,0.000299491,0.001115319],"domain_scores_gemma":[0.9969112,0.0007165004,0.0003212374,0.001130959,0.0005049227,0.0004151563],"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.0001369616,0.0003409569,0.003326877,0.00009109481,0.0008580809,0.000006128385,0.0005179445,0.5287677,0.0001106472,0.004332026,0.03094354,0.430568],"study_design_scores_gemma":[0.002488689,0.000164549,0.003692941,0.000275127,0.0002890377,0.00006862845,0.0003458204,0.9447983,0.0006433057,0.001282919,0.04455959,0.001391092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637555,0.002555485,0.9601441,0.0006390682,0.0005982668,0.001937883,0.001400879,0.0009905136,0.01535825],"genre_scores_gemma":[0.894277,0.004166739,0.09875664,0.0002016588,0.0006612635,0.0004826867,0.001120999,0.00009794971,0.0002351001],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8779014,"threshold_uncertainty_score":0.9994408,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008659082,0.0003958266,0.0004517647,0.0001414144,0.000479101,0.0002537415,0.005491578,0.0001969259,0.0004791589],"category_scores_gemma":[0.0001677963,0.0003349287,0.0001758099,0.00159327,0.0003424489,0.0004173287,0.0007246469,0.0008741823,0.0001674109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004149524,"about_ca_system_score_gemma":0.0004955095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000740464,"about_ca_topic_score_gemma":0.001389828,"domain_scores_codex":[0.9966197,0.0009382829,0.0009181674,0.000488135,0.0003836133,0.0006520711],"domain_scores_gemma":[0.9944052,0.0008068876,0.0004145855,0.003818584,0.0003854182,0.0001693902],"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.00005401354,0.0006531014,0.003943507,0.000007249404,0.00007539251,0.000002801966,0.0003502667,0.2685554,0.00005850491,0.5551875,0.05791269,0.1131995],"study_design_scores_gemma":[0.001147337,0.00007876984,0.01680195,0.0001633712,0.00001661817,0.00002489576,0.00005298907,0.9273637,0.0002167404,0.001787055,0.05181503,0.0005315283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754799,0.001303661,0.6642432,0.04748324,0.0008869707,0.001816466,0.00009784719,0.0005743738,0.1081143],"genre_scores_gemma":[0.9400547,0.001037615,0.05636326,0.002177906,0.00005169429,0.00008669855,0.00003862166,0.00001478066,0.0001747731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7645747,"threshold_uncertainty_score":0.9999103,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003488219,0.0005786934,0.000607839,0.0002194402,0.0004048003,0.0002322906,0.001336912,0.0004547749,0.00008782809],"category_scores_gemma":[0.00001561784,0.0006900496,0.0001489615,0.0009703481,0.0001140744,0.0008566489,0.0001257528,0.0005216257,0.00004839666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143144,"about_ca_system_score_gemma":0.0001551485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002232346,"about_ca_topic_score_gemma":0.01088226,"domain_scores_codex":[0.996962,0.000123969,0.0010808,0.0005589109,0.0002404364,0.001033874],"domain_scores_gemma":[0.9975676,0.0002012214,0.0002702825,0.001367506,0.0003509888,0.0002423927],"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.00003451631,0.0001292261,0.001077594,0.00006904613,0.00006447696,6.639892e-7,0.0001101473,0.9103729,0.00005509163,0.003321863,0.002520547,0.08224393],"study_design_scores_gemma":[0.001309947,0.00003318847,0.0008675119,0.0002606063,0.0000478064,0.00001324458,0.0001531712,0.9741042,0.0002346059,0.0007253026,0.02156695,0.0006834193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02477946,0.003091748,0.963236,0.001010112,0.0006709175,0.001396499,0.0001696836,0.0008860644,0.004759527],"genre_scores_gemma":[0.9561719,0.005951481,0.03539853,0.0002988108,0.0003314671,0.000438175,0.001163399,0.00008698821,0.0001592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9313925,"threshold_uncertainty_score":0.9995551,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003320568,0.0005687528,0.0006161152,0.0001447041,0.0005945424,0.0001823295,0.00105246,0.0004503903,0.0001918039],"category_scores_gemma":[0.00005512241,0.000646062,0.0002146859,0.0006550168,0.000146788,0.0006652264,0.00008295925,0.000488776,0.00008605223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008210724,"about_ca_system_score_gemma":0.0001552421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004078819,"about_ca_topic_score_gemma":0.0006969158,"domain_scores_codex":[0.9971178,0.0001548874,0.0009371032,0.0005162248,0.0002700999,0.001003954],"domain_scores_gemma":[0.9972666,0.0002746734,0.0002647382,0.001359891,0.0004543202,0.0003798102],"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.00004721381,0.0001318571,0.0001248157,0.00002025033,0.0001073649,7.229769e-7,0.00002876727,0.8164634,0.0001290389,0.003626915,0.02811917,0.1512005],"study_design_scores_gemma":[0.001920786,0.00006732186,0.0002444433,0.00008536826,0.0000816964,0.00003029448,0.00005655901,0.8938982,0.0002445027,0.000544682,0.1022096,0.00061655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003412089,0.001489752,0.98351,0.001263376,0.001163413,0.001364829,0.0003063493,0.00129326,0.006196945],"genre_scores_gemma":[0.9272644,0.003033514,0.06715282,0.0003781421,0.0006166322,0.0005333462,0.0006391304,0.00009000764,0.0002920356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238523,"threshold_uncertainty_score":0.999599,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001038149,0.000562196,0.0006320965,0.0002588069,0.0005651769,0.0005869674,0.008582078,0.0004244054,0.00004006127],"category_scores_gemma":[0.000115728,0.000624815,0.000156737,0.001550894,0.0002470234,0.001435519,0.001397688,0.0006027632,0.0001100069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006221097,"about_ca_system_score_gemma":0.0004594374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004499162,"about_ca_topic_score_gemma":0.009683288,"domain_scores_codex":[0.995216,0.0004631271,0.001204051,0.001284847,0.000480267,0.001351774],"domain_scores_gemma":[0.9917725,0.0005310495,0.0005211455,0.006410312,0.0004382008,0.0003267719],"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.0000496508,0.001035424,0.001541809,0.0000237498,0.00010481,0.000009869926,0.0001598166,0.32775,0.00007928391,0.1275319,0.05021681,0.4914969],"study_design_scores_gemma":[0.001101499,0.00005016383,0.0008488409,0.0001108491,0.00002459266,0.00004878812,0.00003868761,0.9032493,0.0001155659,0.0005071668,0.09328657,0.0006179723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01849169,0.001121476,0.9602592,0.008644011,0.001204964,0.001220062,0.0002303055,0.0006872645,0.008141056],"genre_scores_gemma":[0.7614342,0.001398831,0.2346238,0.0008841045,0.0003095172,0.0001635391,0.0007451869,0.00003495286,0.0004058021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7429425,"threshold_uncertainty_score":0.9996203,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002790614,0.0004107132,0.0007946028,0.0004251514,0.0002187136,0.0001170856,0.001250913,0.0002542424,0.000210015],"category_scores_gemma":[0.00003653247,0.0004745571,0.0002495637,0.002495629,0.0001567188,0.0005014798,0.0001288812,0.0003314944,0.00009491984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006128303,"about_ca_system_score_gemma":0.0001177076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002937799,"about_ca_topic_score_gemma":0.002371733,"domain_scores_codex":[0.9973748,0.0001702185,0.0011,0.0003620858,0.0003396506,0.0006532215],"domain_scores_gemma":[0.9971058,0.000147425,0.0003191821,0.001849739,0.0003684149,0.000209443],"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.000006846764,0.00009696042,0.001270595,0.0000276529,0.0007320942,8.89759e-7,0.00008563712,0.9701742,0.000161719,0.008639576,0.005228016,0.01357581],"study_design_scores_gemma":[0.0003730252,0.00001929587,0.002155146,0.00007696405,0.0004890592,0.00001004943,0.0001369319,0.962796,0.0001901786,0.0001121312,0.03317914,0.000462091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08487624,0.007176418,0.797732,0.0007348417,0.001193731,0.001165271,0.0008414646,0.00182511,0.1044549],"genre_scores_gemma":[0.9648917,0.002748885,0.03144381,0.00005763214,0.000106435,0.00008959824,0.000362684,0.00004074875,0.0002585517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8800154,"threshold_uncertainty_score":0.9997706,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008769124,0.0003724813,0.0007867333,0.0004326854,0.0006956544,0.0002016108,0.004533185,0.0001940311,0.000434235],"category_scores_gemma":[0.00008313733,0.0003825777,0.000270133,0.004182125,0.0006389745,0.0006038229,0.002410017,0.0005815311,0.00004132022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004476401,"about_ca_system_score_gemma":0.0002712042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001597837,"about_ca_topic_score_gemma":0.006986411,"domain_scores_codex":[0.9963681,0.001073012,0.0009244383,0.0005944396,0.0003838654,0.0006561558],"domain_scores_gemma":[0.9953928,0.0004559485,0.0003392394,0.002886791,0.0006804104,0.0002448394],"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.00002787589,0.0006744347,0.009580131,0.000004114444,0.0004837889,0.000003668535,0.0007679334,0.03420714,0.00006054894,0.8885421,0.002089035,0.06355923],"study_design_scores_gemma":[0.0007107226,0.00005794314,0.02786973,0.00004946486,0.0001667869,0.000008712342,0.0001225826,0.9667824,0.0001153018,0.0008376305,0.002804874,0.0004738357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2022123,0.001241782,0.7259548,0.01239579,0.0003810215,0.0009851998,0.0001675676,0.0004137463,0.05624774],"genre_scores_gemma":[0.9784302,0.003416624,0.01719278,0.0006932432,0.00003438778,0.00003595117,0.00008278924,0.00000887474,0.0001051937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9325753,"threshold_uncertainty_score":0.9998626,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004961299,0.0004795668,0.0005852482,0.0003033649,0.0002959069,0.0001897895,0.002046413,0.0002140661,0.00004053272],"category_scores_gemma":[0.0001077407,0.0005731598,0.0001225846,0.0006961372,0.0001542536,0.0007643083,0.0001791574,0.0004897252,0.0001486757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118625,"about_ca_system_score_gemma":0.000156857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002696358,"about_ca_topic_score_gemma":0.002162764,"domain_scores_codex":[0.9972648,0.0001799055,0.001125016,0.0003938738,0.0002568939,0.0007794866],"domain_scores_gemma":[0.9965668,0.0002874812,0.0002406786,0.002401035,0.0003076354,0.0001963925],"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.00006742818,0.0009098051,0.0003055374,0.0002649546,0.0001716656,0.000001790348,0.0003354465,0.7329396,0.001423898,0.1039126,0.05521895,0.1044483],"study_design_scores_gemma":[0.001165676,0.0001149572,0.0006800353,0.000301584,0.00003359762,0.00003320717,0.0001782045,0.9302225,0.001297744,0.005334186,0.05983723,0.0008011036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01336597,0.004933205,0.9295512,0.00261088,0.00089266,0.003868516,0.0007837075,0.003500687,0.04049319],"genre_scores_gemma":[0.90785,0.00234626,0.08728571,0.0001246581,0.00007317622,0.001681735,0.0003543134,0.00006218594,0.0002219666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.894484,"threshold_uncertainty_score":0.999672,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007236287,0.0005566558,0.0005985375,0.0001924872,0.00133861,0.0008426714,0.006574405,0.0002143734,0.0004061165],"category_scores_gemma":[0.0001533749,0.0005968785,0.0002431486,0.001664233,0.0002946856,0.001139318,0.001657733,0.0006792227,0.001960951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007527526,"about_ca_system_score_gemma":0.0005472113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005464693,"about_ca_topic_score_gemma":0.0007793266,"domain_scores_codex":[0.9960621,0.0006705973,0.0009566817,0.0007705141,0.0004854844,0.001054594],"domain_scores_gemma":[0.9935419,0.0003085116,0.0004135645,0.004578029,0.0006792282,0.000478792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002761107,0.001218488,0.0006863253,0.00001839619,0.0002808477,0.00001109392,0.0005773333,0.004522668,0.002262321,0.3673576,0.3772703,0.2457671],"study_design_scores_gemma":[0.001075601,0.00007855966,0.002561494,0.0001155086,0.00004242775,0.0001361499,0.00004757963,0.3478416,0.0007531813,0.001359477,0.6450076,0.000980886],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02275772,0.003993403,0.6858679,0.1098861,0.001315555,0.001975013,0.0006076905,0.003488309,0.1701083],"genre_scores_gemma":[0.9218172,0.003765535,0.07087109,0.001358706,0.0001657807,0.0001087797,0.0002175599,0.00002451626,0.001670756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8990595,"threshold_uncertainty_score":0.9999615,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001643709,0.0006571777,0.0007797992,0.0003414272,0.001200796,0.0008354225,0.007176801,0.0004101177,0.00007608707],"category_scores_gemma":[0.0002164549,0.0007506807,0.0002181664,0.001508337,0.0003718407,0.0007761139,0.001358697,0.0008551989,0.0008654945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414679,"about_ca_system_score_gemma":0.001024608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00120132,"about_ca_topic_score_gemma":0.004952099,"domain_scores_codex":[0.9949431,0.0008599815,0.001247752,0.001023304,0.0008266736,0.001099231],"domain_scores_gemma":[0.991072,0.000535022,0.0006080636,0.006175206,0.001047053,0.0005626291],"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.0001009558,0.002227258,0.003805865,0.00008329588,0.0002127203,0.000006853755,0.0007009415,0.0115431,0.001943482,0.6832286,0.2532305,0.0429165],"study_design_scores_gemma":[0.002989196,0.0003742204,0.01973912,0.0007983257,0.0001689692,0.0002778154,0.0005605124,0.6808741,0.01012477,0.01403407,0.2661724,0.003886447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03062589,0.0005851629,0.8982106,0.01649925,0.0008461511,0.002300608,0.0003110461,0.003496815,0.0471244],"genre_scores_gemma":[0.7605042,0.0001385515,0.2367894,0.001654487,0.000084102,0.0003873507,0.000194238,0.00002666201,0.0002209031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7298784,"threshold_uncertainty_score":0.9999124,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062011,0.0007641346,0.0008005215,0.0002121929,0.0005015203,0.0002060981,0.002467404,0.0004519968,0.0006757674],"category_scores_gemma":[0.00003756381,0.0009015468,0.0003163986,0.001152118,0.0002113439,0.0005678041,0.0001775556,0.0009092415,0.00107848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073975,"about_ca_system_score_gemma":0.0002767958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001946952,"about_ca_topic_score_gemma":0.01119495,"domain_scores_codex":[0.9958234,0.0001907357,0.001226925,0.0007396968,0.0005435963,0.001475606],"domain_scores_gemma":[0.9959657,0.0001397085,0.0001514912,0.002807936,0.0002750121,0.0006601193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001216895,0.001414033,0.002272117,0.0002054527,0.0004935676,0.00001967343,0.001318406,0.5041575,0.0005432452,0.008223902,0.1050835,0.3761469],"study_design_scores_gemma":[0.001742573,0.0001124961,0.005127179,0.0001663588,0.0002016593,0.00009590287,0.0002846754,0.1434356,0.000460942,0.0006440944,0.8459726,0.0017559],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6887346,0.006566726,0.06587044,0.005925048,0.004541964,0.008837756,0.001877282,0.007144489,0.2105017],"genre_scores_gemma":[0.9793887,0.0008520926,0.01686965,0.0006917522,0.0004005792,0.001010442,0.0002652105,0.00008378817,0.0004378309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7408891,"threshold_uncertainty_score":0.9996993,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004148862,0.0005913355,0.0005931248,0.0002331846,0.000638532,0.0001986736,0.002703124,0.0003406076,0.0002269743],"category_scores_gemma":[0.00009863701,0.0007006931,0.0002742809,0.0006501416,0.0002891604,0.0006345962,0.000219594,0.0006139005,0.0001544173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008799128,"about_ca_system_score_gemma":0.0003123473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004726155,"about_ca_topic_score_gemma":0.001432176,"domain_scores_codex":[0.9970438,0.0001554196,0.001027369,0.0004778179,0.0003396322,0.0009559057],"domain_scores_gemma":[0.9955792,0.0003833246,0.0002610371,0.002970395,0.0004888679,0.0003171081],"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.0001473771,0.001524701,0.001329379,0.0003076933,0.0005930226,0.000005112815,0.0002684082,0.2277609,0.005184608,0.2093192,0.2482533,0.3053064],"study_design_scores_gemma":[0.001463107,0.00009158468,0.0006317508,0.000177101,0.0000858443,0.0000366118,0.00008683409,0.3301646,0.005591942,0.003632135,0.6568701,0.001168409],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891928,0.002805983,0.9095406,0.00798463,0.0007301715,0.002800268,0.003165641,0.006180324,0.04787309],"genre_scores_gemma":[0.7988849,0.001223189,0.1977071,0.0004711087,0.0001332603,0.0007175066,0.0005843974,0.00007548746,0.0002030361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7799657,"threshold_uncertainty_score":0.9995444,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008583926,0.0003813961,0.0007360781,0.0004703211,0.0001372817,0.00005514122,0.002335294,0.0002348085,0.0004946647],"category_scores_gemma":[0.0002958028,0.0003436464,0.0003087573,0.002809624,0.0004299066,0.0003330036,0.0001193675,0.0005007542,0.00004527282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004531278,"about_ca_system_score_gemma":0.0002324319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008279401,"about_ca_topic_score_gemma":0.005138834,"domain_scores_codex":[0.9967459,0.0004920135,0.001260087,0.0004157806,0.0005371034,0.0005491272],"domain_scores_gemma":[0.9959006,0.0003255018,0.0003366433,0.002938828,0.0003604728,0.0001379726],"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.0001022084,0.002468158,0.02579198,0.0002259962,0.001916152,0.000003030638,0.003602204,0.886995,0.002213696,0.02317333,0.03454847,0.01895975],"study_design_scores_gemma":[0.003490611,0.0006833649,0.2047586,0.0009765413,0.002650506,0.00007323698,0.003033263,0.6745684,0.01411401,0.01663343,0.07572761,0.003290467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9420589,0.0009090829,0.001924079,0.002612525,0.0006078524,0.001635633,0.002102551,0.0002607473,0.04788858],"genre_scores_gemma":[0.9942619,0.0004152324,0.004740781,0.00005471553,0.00005179296,0.0002407409,0.0001182211,0.00001845207,0.00009812184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2124266,"threshold_uncertainty_score":0.9999015,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003734167,0.0003859077,0.0005833263,0.0002767492,0.0001958863,0.00006687191,0.001390753,0.0002607439,0.00004218557],"category_scores_gemma":[0.00005728403,0.0004152182,0.0001089077,0.0007676322,0.0002365376,0.0006930432,0.00009320455,0.0004402238,0.00001460232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008791314,"about_ca_system_score_gemma":0.0002133056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005319801,"about_ca_topic_score_gemma":0.002370883,"domain_scores_codex":[0.9976559,0.0001729998,0.001014959,0.0003420901,0.0002588619,0.000555212],"domain_scores_gemma":[0.9968859,0.0001252378,0.0003011983,0.002104443,0.000446946,0.0001362536],"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.0003584766,0.001754122,0.009424116,0.0009487535,0.0009651292,0.000006249889,0.002681455,0.5975666,0.02755641,0.1568383,0.04687076,0.1550297],"study_design_scores_gemma":[0.00974493,0.00105611,0.01157153,0.004944383,0.00052597,0.0005935053,0.006373425,0.5832817,0.04844143,0.01382107,0.3134161,0.006229827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3767717,0.01324182,0.4750953,0.004362667,0.001706522,0.009560456,0.00355362,0.004481381,0.1112265],"genre_scores_gemma":[0.9159792,0.001742435,0.081273,0.00002718783,0.00006084836,0.0005790009,0.000178442,0.00004849147,0.0001113772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5392075,"threshold_uncertainty_score":0.9998299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009848335,0.0008226747,0.0009251402,0.0002616936,0.000713377,0.0006968769,0.006131988,0.0005935875,0.0001907184],"category_scores_gemma":[0.00006322188,0.0008893189,0.0003078125,0.00257971,0.0003425166,0.0008873985,0.001157931,0.00116286,0.0005840593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008251228,"about_ca_system_score_gemma":0.0004485902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005169359,"about_ca_topic_score_gemma":0.005854964,"domain_scores_codex":[0.9933136,0.0008457034,0.001584161,0.001273619,0.0007039165,0.00227907],"domain_scores_gemma":[0.9935421,0.0004139207,0.0005477645,0.004497292,0.0004129415,0.0005860064],"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.00002315647,0.000484234,0.001155618,0.000005615708,0.00005793163,0.00002603431,0.0001023795,0.8785517,0.0000150988,0.02852394,0.0343207,0.05673359],"study_design_scores_gemma":[0.001084383,0.0000707903,0.002853629,0.0001487654,0.00002437128,0.0001377408,0.00003948916,0.8551321,0.00003424268,0.0009486868,0.1386029,0.000922889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03440097,0.004527929,0.8555552,0.01944659,0.003111398,0.001584934,0.00008383861,0.001940937,0.07934816],"genre_scores_gemma":[0.8031527,0.001498615,0.1911644,0.002445842,0.0006357669,0.000132665,0.0001078677,0.00004826989,0.0008138126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7687518,"threshold_uncertainty_score":0.9993557,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000684146,0.0003412745,0.0004392558,0.0005402499,0.0003006988,0.0002541554,0.00533151,0.0002967647,0.000123107],"category_scores_gemma":[0.0002926008,0.0003920622,0.0001488668,0.002045528,0.0002171455,0.001501818,0.001068835,0.0004593243,0.00006420497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007948069,"about_ca_system_score_gemma":0.0005876424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001115289,"about_ca_topic_score_gemma":0.01772892,"domain_scores_codex":[0.9958906,0.0009673818,0.001256562,0.0005850054,0.0006804271,0.0006200155],"domain_scores_gemma":[0.9942462,0.0004772502,0.0005860837,0.003644568,0.000852577,0.0001933205],"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.0001107369,0.00142282,0.001699689,0.00002786789,0.0001255451,0.000002159991,0.0009726551,0.0860056,0.0008548144,0.2049051,0.008275837,0.6955972],"study_design_scores_gemma":[0.001220948,0.00006917126,0.01063152,0.00008249935,0.00001236705,0.00002169141,0.00006297533,0.966395,0.001049013,0.005867576,0.0142261,0.0003611547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008518798,0.0005138706,0.9720723,0.00600854,0.0003343787,0.000504284,0.00007689695,0.0002689754,0.01170195],"genre_scores_gemma":[0.8744203,0.0007695952,0.1239618,0.0002683403,0.00006378433,0.000202696,0.0001201425,0.00001746604,0.0001759203],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8803894,"threshold_uncertainty_score":0.9998531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007456728,0.0004261906,0.000702061,0.0002183528,0.001242341,0.0002905186,0.006533941,0.0001797069,0.00009743594],"category_scores_gemma":[0.00008016964,0.0003639816,0.0004251582,0.003616246,0.0004098561,0.0007148794,0.001181711,0.0004966991,0.00003112486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003855017,"about_ca_system_score_gemma":0.0005129752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001859826,"about_ca_topic_score_gemma":0.002848239,"domain_scores_codex":[0.9968091,0.0005129472,0.001007657,0.0005928932,0.0003724302,0.000705014],"domain_scores_gemma":[0.993374,0.0003752533,0.000584157,0.004289576,0.001183502,0.0001934339],"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.00009610608,0.001279753,0.00912581,0.00003643105,0.002280878,5.606724e-7,0.001356363,0.1317385,0.0007764582,0.1418906,0.03652927,0.6748893],"study_design_scores_gemma":[0.0006136397,0.00006024216,0.01185496,0.00007126478,0.0001898348,0.000005680001,0.00005239011,0.905706,0.0003135997,0.00005922416,0.08066683,0.0004063782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1712382,0.00610756,0.7792693,0.01995271,0.0009182729,0.002252179,0.0003147684,0.0005188265,0.0194282],"genre_scores_gemma":[0.9372073,0.009242385,0.05136637,0.001213617,0.00005795286,0.000233835,0.00009665029,0.00001629153,0.000565559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7739674,"threshold_uncertainty_score":0.9998812,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002898283,0.000549108,0.0005872346,0.000223911,0.0005052869,0.0003623707,0.0005667922,0.0003918617,0.00005327421],"category_scores_gemma":[0.00004897533,0.0006319329,0.00009489865,0.0005759373,0.0001940803,0.0008053239,0.0001706523,0.0004231839,0.00002338677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004524217,"about_ca_system_score_gemma":0.00007233211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005726884,"about_ca_topic_score_gemma":0.0000874348,"domain_scores_codex":[0.9974636,0.00009707476,0.0007990858,0.0005281292,0.0002187419,0.0008933494],"domain_scores_gemma":[0.9981179,0.0002435142,0.0002209407,0.0008069355,0.0002821481,0.0003285767],"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.00003733849,0.00007600022,0.0003745678,0.00004610093,0.0001849036,0.000002824891,0.0002250149,0.9796525,0.0002442359,0.003114427,0.005316762,0.01072528],"study_design_scores_gemma":[0.001341863,0.00008102413,0.0004082744,0.0001638772,0.00008526975,0.0001376368,0.0001521046,0.975554,0.0001066362,0.00007560391,0.02122747,0.0006662186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2246519,0.007620389,0.7576935,0.0004614051,0.001382439,0.001914838,0.0005415133,0.001248086,0.004485912],"genre_scores_gemma":[0.9163439,0.002906614,0.07975875,0.00007783641,0.0001527235,0.000207906,0.0002679001,0.00007802378,0.0002063459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6916921,"threshold_uncertainty_score":0.9996132,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002758761,0.0004384228,0.0006834736,0.0002981999,0.0003913702,0.0001249405,0.001601806,0.0004511733,0.0000348262],"category_scores_gemma":[0.00007139237,0.0004750561,0.0001080694,0.0004602067,0.0002965393,0.0004114416,0.0001015549,0.0004769513,0.00002346705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003018857,"about_ca_system_score_gemma":0.000107723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001606954,"about_ca_topic_score_gemma":0.001121291,"domain_scores_codex":[0.9976743,0.0001798911,0.0009616127,0.0004015452,0.0002400722,0.0005425648],"domain_scores_gemma":[0.9965494,0.0002293112,0.0003194018,0.002366715,0.0003632338,0.0001719621],"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.0003135384,0.002322812,0.007689882,0.0005108734,0.001202488,0.000001056706,0.002274018,0.4154483,0.01570218,0.1857392,0.06420216,0.3045935],"study_design_scores_gemma":[0.002293104,0.0004378819,0.007043778,0.0002020217,0.0001653975,0.00004523484,0.0008402325,0.8658342,0.01114802,0.006888966,0.1039574,0.001143743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9271497,0.003918269,0.05228807,0.002005297,0.0008879435,0.002444699,0.001029103,0.001408429,0.008868447],"genre_scores_gemma":[0.9809472,0.0008210938,0.01731637,0.00006628524,0.0001027285,0.0003177511,0.0003145057,0.00004459682,0.00006944857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4503859,"threshold_uncertainty_score":0.9997701,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007771456,0.00062087,0.0006227251,0.0002471895,0.001442374,0.0007296486,0.005013917,0.000235901,0.0001879505],"category_scores_gemma":[0.0002316434,0.0006793161,0.0003474829,0.0009630346,0.0002592178,0.001291101,0.0007058667,0.0005159295,0.0001623266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005671503,"about_ca_system_score_gemma":0.0005342782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001468865,"about_ca_topic_score_gemma":0.005909692,"domain_scores_codex":[0.9957712,0.0005710439,0.001224336,0.000922768,0.0004492925,0.001061305],"domain_scores_gemma":[0.9940877,0.0006581968,0.0004726073,0.003419607,0.0009567055,0.0004051969],"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.00008934722,0.001042524,0.0006890486,0.0000307437,0.0002169782,0.000002314772,0.0009580444,0.1472816,0.0006049891,0.04593053,0.02533632,0.7778175],"study_design_scores_gemma":[0.002554518,0.00008170938,0.0005103098,0.00007803159,0.00003760085,0.0000278827,0.00004156715,0.8527403,0.0004643883,0.0003174907,0.1424651,0.0006811515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002342943,0.0007871603,0.9708136,0.01498806,0.0006308441,0.001447799,0.000196744,0.0006776685,0.008115207],"genre_scores_gemma":[0.6428215,0.0009862582,0.3538111,0.001106859,0.000217289,0.0003248308,0.000262275,0.00002903628,0.0004408521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7771364,"threshold_uncertainty_score":0.9998576,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003543024,0.000561063,0.0005945819,0.0002016147,0.000434741,0.0002214587,0.001812066,0.0003195753,0.0006003932],"category_scores_gemma":[0.00006233767,0.0006359011,0.0001121455,0.0006074309,0.0004036428,0.0008293783,0.0003529249,0.0006350029,0.0005214447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005428812,"about_ca_system_score_gemma":0.0001286393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004429929,"about_ca_topic_score_gemma":0.002392047,"domain_scores_codex":[0.9975082,0.0002471006,0.0008079397,0.0004413133,0.0002489052,0.0007464999],"domain_scores_gemma":[0.996253,0.0002140933,0.0002092482,0.002770485,0.0002447464,0.0003083853],"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.00006142874,0.001054554,0.003068543,0.0001619911,0.0008167949,0.00001437733,0.0004966569,0.03085339,0.03933669,0.3548631,0.3117315,0.257541],"study_design_scores_gemma":[0.003679644,0.000263439,0.02211262,0.0005551963,0.0002952571,0.0002309006,0.0002007272,0.228078,0.02772469,0.05991682,0.6522123,0.004730426],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4479566,0.01938169,0.1469804,0.01580187,0.001227033,0.004051367,0.003680297,0.01552765,0.3453931],"genre_scores_gemma":[0.8371953,0.008414869,0.1528311,0.0003319435,0.00008689411,0.0001727406,0.0002512522,0.00006434281,0.0006516494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3892386,"threshold_uncertainty_score":0.9996092,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005329327,0.0003360928,0.000562664,0.0002301842,0.0003520367,0.0002011696,0.002395648,0.0002023829,0.00002371775],"category_scores_gemma":[0.00009681955,0.0003623525,0.00006741504,0.0007855245,0.0002288028,0.001699119,0.0009269417,0.0004936287,0.00001523835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003208594,"about_ca_system_score_gemma":0.0001294813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001788479,"about_ca_topic_score_gemma":0.001268217,"domain_scores_codex":[0.9972488,0.0002804642,0.001009412,0.0005462369,0.000304169,0.0006109506],"domain_scores_gemma":[0.9969516,0.000252361,0.0005179244,0.001864511,0.000233515,0.0001801028],"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.0001004947,0.001170634,0.1687513,0.00009338962,0.00006488934,0.000003598733,0.0008752122,0.03097592,0.004359662,0.04955965,0.01930323,0.724742],"study_design_scores_gemma":[0.0008041868,0.00007986509,0.01882556,0.0002699839,0.000009710998,0.00002438531,0.0001047476,0.9677988,0.002788352,0.000648409,0.008249112,0.0003969205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1423862,0.0008440465,0.850912,0.0009584735,0.0002372162,0.0006084065,0.00007762565,0.0004393857,0.003536657],"genre_scores_gemma":[0.8128909,0.001787309,0.1850413,0.0001119747,0.00002863457,0.00004240938,0.00005557439,0.00001076658,0.00003105403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9368228,"threshold_uncertainty_score":0.9998828,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003731345,0.0005309171,0.0005894282,0.0002065743,0.000552736,0.0002509022,0.002105366,0.0003704558,0.0000885054],"category_scores_gemma":[0.00006292103,0.0006157809,0.0002281364,0.0005993619,0.0001856282,0.0006300907,0.0001829396,0.0004611514,0.0002315527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044776,"about_ca_system_score_gemma":0.0001250231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000194547,"about_ca_topic_score_gemma":0.001749482,"domain_scores_codex":[0.9972458,0.0002062753,0.001035032,0.0004289935,0.0002712588,0.0008126405],"domain_scores_gemma":[0.9959776,0.0001851937,0.0002629008,0.00284573,0.0004692366,0.0002593877],"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.0001362501,0.000796508,0.0002537592,0.0003296151,0.0006646989,0.000001992252,0.0003328476,0.1916367,0.02711181,0.09667366,0.1656,0.5164621],"study_design_scores_gemma":[0.001205826,0.0000679471,0.0002084134,0.00009910316,0.00006882101,0.00005651438,0.0001307538,0.3625821,0.01079677,0.002077399,0.62183,0.0008763165],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03180899,0.007163791,0.908725,0.00217691,0.001483484,0.00336012,0.0009031189,0.005975344,0.03840327],"genre_scores_gemma":[0.8863225,0.0041882,0.1068422,0.0001716918,0.0002048501,0.001363994,0.0002672824,0.00008001794,0.000559254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8545135,"threshold_uncertainty_score":0.9996294,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005342417,0.0007424981,0.000762208,0.0002666733,0.0007153245,0.0002679681,0.003136471,0.0004281702,0.0003758138],"category_scores_gemma":[0.00008778667,0.00086573,0.0002599549,0.000804836,0.0004354275,0.000873726,0.0004697026,0.001197266,0.000819583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035446,"about_ca_system_score_gemma":0.00021712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001200548,"about_ca_topic_score_gemma":0.001008192,"domain_scores_codex":[0.9964077,0.0003569722,0.001105992,0.000564034,0.0004776698,0.001087563],"domain_scores_gemma":[0.9950673,0.0002573399,0.0002926742,0.003632196,0.0003388707,0.000411637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007931273,0.002074928,0.00276366,0.0002452472,0.001184209,0.00001253167,0.00127916,0.3267928,0.02284721,0.1587156,0.2172056,0.2667997],"study_design_scores_gemma":[0.001169629,0.00008231612,0.001560252,0.0002659642,0.0001316333,0.0002800302,0.0001838291,0.4408972,0.01004847,0.006395666,0.5368209,0.002164054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2534094,0.006118742,0.2678192,0.01218495,0.000862627,0.003224277,0.002225025,0.01489501,0.4392608],"genre_scores_gemma":[0.8441933,0.002382997,0.1518359,0.0002679501,0.0001423886,0.0002605555,0.0002795575,0.00008342769,0.0005539712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5907839,"threshold_uncertainty_score":0.9999584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002679663,0.0005492764,0.000543071,0.0002655715,0.0002410321,0.0001641939,0.001437346,0.0003421723,0.0004516653],"category_scores_gemma":[0.00003665072,0.0006654832,0.0001390571,0.001088718,0.0002123334,0.0008601937,0.000126111,0.0006624034,0.0005817956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001548542,"about_ca_system_score_gemma":0.0001982391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002158637,"about_ca_topic_score_gemma":0.01029271,"domain_scores_codex":[0.9970053,0.000165307,0.0009918009,0.0004876426,0.0003376771,0.001012214],"domain_scores_gemma":[0.9975482,0.00009510812,0.0001999984,0.001671495,0.0002018639,0.0002833148],"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.0000181644,0.0002020431,0.003816924,0.00002199718,0.00006219499,0.000003954804,0.00009808004,0.9124646,0.00009762946,0.003559937,0.02099186,0.05866267],"study_design_scores_gemma":[0.001804811,0.00005025099,0.00448067,0.0001798698,0.00004698724,0.0000483267,0.0001599515,0.8800011,0.0006661554,0.001516226,0.1098253,0.001220395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3071896,0.003683881,0.519313,0.004600135,0.002960614,0.002372326,0.0005623937,0.003433862,0.1558842],"genre_scores_gemma":[0.9215117,0.002301684,0.07478786,0.0002656088,0.0002167109,0.0001653137,0.0003626665,0.00006643334,0.0003220283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6143221,"threshold_uncertainty_score":0.9995797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003062592,0.0005747668,0.0005493918,0.0002461183,0.0008525383,0.0001844112,0.001587917,0.0002267743,0.0003378179],"category_scores_gemma":[0.0000547592,0.0006198692,0.0001977338,0.0007191576,0.0004762419,0.0007348724,0.0001807562,0.0005623557,0.0001655509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006088628,"about_ca_system_score_gemma":0.0004151425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005334487,"about_ca_topic_score_gemma":0.001777987,"domain_scores_codex":[0.9971577,0.0001609753,0.0009825109,0.0004857789,0.0003900474,0.0008229733],"domain_scores_gemma":[0.9959159,0.0004847256,0.0002687209,0.002262452,0.0007372456,0.0003308794],"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.00006868816,0.0006418131,0.0006339363,0.00003571948,0.0003092477,0.000001709036,0.000163403,0.8076938,0.0006951806,0.1026303,0.02901378,0.05811241],"study_design_scores_gemma":[0.00338359,0.0002925206,0.001292906,0.0002224989,0.0002129531,0.0002431617,0.0003307036,0.7717766,0.002989474,0.004838534,0.2125401,0.001877039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05696457,0.001574919,0.8816653,0.004515134,0.0003380566,0.002849811,0.00216455,0.003471251,0.04645639],"genre_scores_gemma":[0.6137111,0.0002763519,0.3842041,0.000201049,0.00007999029,0.0006304301,0.0006320906,0.00005445041,0.0002105121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5567465,"threshold_uncertainty_score":0.9996253,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005987535,0.0005086153,0.0006569392,0.0003501297,0.0007155329,0.0002385658,0.005043254,0.0002655303,0.0001741737],"category_scores_gemma":[0.0003258232,0.0005444707,0.0002795418,0.0009606418,0.0004388596,0.001680007,0.001592585,0.0005487263,0.0002310123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005924323,"about_ca_system_score_gemma":0.000615831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000328433,"about_ca_topic_score_gemma":0.001041807,"domain_scores_codex":[0.9959073,0.0003824097,0.001398548,0.0008093231,0.0006246332,0.0008777892],"domain_scores_gemma":[0.9938712,0.0003320848,0.0007706599,0.003809868,0.0008315394,0.0003846997],"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.00007072247,0.002970587,0.002170013,0.00008416251,0.0003496969,0.000009652871,0.0009938935,0.01696705,0.0240625,0.5309129,0.189261,0.2321478],"study_design_scores_gemma":[0.002161255,0.0002074746,0.003441898,0.000437938,0.00007406538,0.0002813365,0.000281727,0.7115517,0.02000188,0.04047668,0.2194397,0.001644306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003788705,0.0006321429,0.9802824,0.003741243,0.0003763725,0.0006476503,0.000418872,0.001075426,0.009037232],"genre_scores_gemma":[0.5866039,0.0005414588,0.4118232,0.0003993179,0.00005888722,0.0001294333,0.0001083918,0.00001757292,0.0003178552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6945847,"threshold_uncertainty_score":0.9997007,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003308548,0.000363937,0.0006031182,0.0002054925,0.0003137954,0.00007318066,0.0009414795,0.0002312455,0.00007704946],"category_scores_gemma":[0.0001042046,0.0003089083,0.0002373522,0.002227629,0.0001823689,0.0003698244,0.00007290662,0.0002891769,0.00001276692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006638038,"about_ca_system_score_gemma":0.0002068822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002418696,"about_ca_topic_score_gemma":0.01248244,"domain_scores_codex":[0.9978654,0.0001821366,0.0008490314,0.0003838128,0.0002269103,0.0004927246],"domain_scores_gemma":[0.9971657,0.000132725,0.0004060333,0.001373551,0.000806366,0.0001156283],"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.00005278129,0.0001763746,0.00505404,0.00004431624,0.0008482586,1.241989e-7,0.0002428392,0.9867558,0.0005028775,0.001234884,0.0008125532,0.004275175],"study_design_scores_gemma":[0.0008035194,0.00008884235,0.003833605,0.00009516347,0.0007456505,0.00001226385,0.0001026282,0.988883,0.0007672432,0.0003483639,0.003905854,0.0004139346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05604472,0.0002668987,0.9346476,0.0007463064,0.000513797,0.002462035,0.0007121293,0.0005365855,0.00406998],"genre_scores_gemma":[0.9534208,0.000162048,0.04551501,0.00004432803,0.00004943226,0.0002787114,0.0002412292,0.00003325379,0.0002551409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8973761,"threshold_uncertainty_score":0.9999363,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008727878,0.0005172084,0.0006197231,0.0002434236,0.001988351,0.0006446816,0.004678635,0.0002382553,0.0001300764],"category_scores_gemma":[0.00006481004,0.0005675078,0.0001653664,0.001914731,0.0003394008,0.001478568,0.003232049,0.000875786,0.00008146493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155526,"about_ca_system_score_gemma":0.0004936756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003390665,"about_ca_topic_score_gemma":0.00695991,"domain_scores_codex":[0.9957628,0.001172574,0.0008961551,0.0007713165,0.0004090853,0.0009880865],"domain_scores_gemma":[0.9955698,0.0002838172,0.0003718971,0.002882488,0.0005704302,0.0003215327],"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.0000892986,0.002362123,0.02129469,0.00003098469,0.000367488,0.00005997813,0.003433543,0.1572108,0.001273748,0.2258683,0.02090761,0.5671014],"study_design_scores_gemma":[0.001116952,0.00004228003,0.00777103,0.0001641645,0.00002768853,0.00006318561,0.0001693553,0.9741881,0.0002174074,0.0002737422,0.01517365,0.0007924181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1523329,0.001582419,0.8119294,0.008880896,0.0006659274,0.0009913695,0.00005827181,0.0006178998,0.02294092],"genre_scores_gemma":[0.9443505,0.002920143,0.05109714,0.00117129,0.0001061715,0.00003722632,0.00004383486,0.00001838601,0.0002553512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8169773,"threshold_uncertainty_score":0.9996777,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009168753,0.0002927679,0.0003956263,0.0002511276,0.0001515836,0.00005016423,0.0007449221,0.0002147769,0.0000598843],"category_scores_gemma":[0.00009281647,0.0003536713,0.00008456073,0.0004489013,0.0001420774,0.000606094,0.0001056561,0.0002861138,0.000007750014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005133214,"about_ca_system_score_gemma":0.0001426646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008798696,"about_ca_topic_score_gemma":0.0009728293,"domain_scores_codex":[0.9979779,0.0002116236,0.0008338165,0.0002822666,0.0003048624,0.0003895662],"domain_scores_gemma":[0.9978064,0.00020685,0.0002239722,0.001223788,0.0004388192,0.0001001458],"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.0000571682,0.0005331501,0.001278496,0.0001810912,0.0001629526,3.360189e-7,0.0007555407,0.499973,0.01187715,0.02511769,0.002950832,0.4571126],"study_design_scores_gemma":[0.001146347,0.00004087173,0.003922895,0.0001729064,0.00005835409,0.000008730412,0.0001502408,0.9588561,0.007969749,0.02336888,0.003872799,0.0004321369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6287994,0.008528464,0.3226154,0.002665074,0.0003586375,0.004804209,0.0006206775,0.001434357,0.03017378],"genre_scores_gemma":[0.9124646,0.001659865,0.08505581,0.00005927801,0.0000393702,0.0004679697,0.000204024,0.00003153909,0.0000175477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4588831,"threshold_uncertainty_score":0.9998915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007118179,0.0004167457,0.0004310372,0.00009480316,0.001012082,0.000616777,0.003953583,0.0002203326,0.00003849646],"category_scores_gemma":[0.000120243,0.0003476283,0.0002602715,0.0006334579,0.0002628615,0.000720991,0.0002739035,0.0003661684,0.0003712669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006422435,"about_ca_system_score_gemma":0.0004478604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005768735,"about_ca_topic_score_gemma":0.0008582247,"domain_scores_codex":[0.9970617,0.0003425204,0.0007793552,0.000627146,0.0003785034,0.000810761],"domain_scores_gemma":[0.9949588,0.00103482,0.0004374471,0.002794363,0.0005445323,0.0002301023],"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.00002736664,0.0001478034,0.00004108643,0.00001625711,0.0001320487,0.000001767905,0.0001519515,0.01238983,0.00000382036,0.2957172,0.0286324,0.6627384],"study_design_scores_gemma":[0.0009245798,0.00007759825,0.0003845928,0.00007778959,0.00009090108,0.0001092439,0.0001453114,0.9193988,0.00001543114,0.00486115,0.07351489,0.0003996604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001747241,0.001195607,0.9662464,0.02416427,0.001021603,0.001395965,0.0001725813,0.0006198422,0.003436502],"genre_scores_gemma":[0.8545691,0.0003589952,0.1428277,0.0009225657,0.0001375717,0.00060884,0.00008099741,0.0000172057,0.000477026],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.907009,"threshold_uncertainty_score":0.9998976,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006599665,0.0004007882,0.0004482326,0.0002559532,0.0002998915,0.0001736273,0.001687578,0.0002586069,0.00007007656],"category_scores_gemma":[0.00007559863,0.0004531158,0.0001615196,0.0006304194,0.0001473011,0.0006723683,0.0001450075,0.0004381553,0.00009630386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007203032,"about_ca_system_score_gemma":0.0002364095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001459506,"about_ca_topic_score_gemma":0.00585558,"domain_scores_codex":[0.9975061,0.0001898367,0.0009330712,0.0004192282,0.0002006458,0.0007510571],"domain_scores_gemma":[0.9965625,0.0001480844,0.0001251455,0.00258456,0.0002684828,0.0003111794],"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.00007457905,0.0009150656,0.002122211,0.00004271061,0.0001013885,0.000001398632,0.0004337812,0.878702,0.0007635413,0.04670944,0.03708841,0.03304544],"study_design_scores_gemma":[0.0009100711,0.00003992266,0.005866871,0.00004535571,0.00004095877,0.000007085425,0.00006275361,0.9558215,0.0001577611,0.002155534,0.0344219,0.0004703274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4554119,0.001450482,0.4907974,0.00726729,0.00043718,0.002303933,0.001268378,0.001483184,0.03958024],"genre_scores_gemma":[0.956335,0.0006827952,0.04157142,0.000235199,0.00006935757,0.0002803623,0.0004781666,0.00004166163,0.0003060113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5009232,"threshold_uncertainty_score":0.999792,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001550768,0.0005164361,0.0008264208,0.0005925972,0.0004981371,0.0005349332,0.008232093,0.0003238496,0.0001561047],"category_scores_gemma":[0.0001044749,0.0005652612,0.0001800864,0.002412809,0.0003623363,0.001810368,0.001823086,0.0008629874,0.0004896087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001014856,"about_ca_system_score_gemma":0.0006422582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007664436,"about_ca_topic_score_gemma":0.0006235511,"domain_scores_codex":[0.9948308,0.0008577045,0.001412351,0.0007491168,0.0008437519,0.001306268],"domain_scores_gemma":[0.9929992,0.0004863738,0.0006323559,0.004961583,0.000565019,0.0003554897],"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.0001469863,0.002732425,0.03494595,0.0003384609,0.0004466597,0.00001911,0.003016481,0.4657513,0.004372553,0.2065632,0.04978414,0.2318827],"study_design_scores_gemma":[0.0009103667,0.00009484359,0.005968682,0.0004390987,0.00001316984,0.00005657927,0.00008099122,0.9679108,0.0005176617,0.0002084282,0.02321758,0.0005817472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7983342,0.004069856,0.06104165,0.009918164,0.001449541,0.002875032,0.0001709683,0.001022061,0.1211185],"genre_scores_gemma":[0.9739178,0.002054824,0.02239242,0.0001116576,0.0001281355,0.0001879104,0.00004709974,0.00003064569,0.001129507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5021595,"threshold_uncertainty_score":0.9996799,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002175096,0.0007498097,0.0007393425,0.000275858,0.0005689807,0.00024142,0.003253422,0.0004328156,0.001047968],"category_scores_gemma":[0.0001023517,0.0008540351,0.0002848624,0.0007587495,0.0003536356,0.0007267219,0.0005046448,0.0008672932,0.001383229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009755117,"about_ca_system_score_gemma":0.0001597343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001408313,"about_ca_topic_score_gemma":0.001388747,"domain_scores_codex":[0.9965953,0.0002738998,0.001067007,0.0005446908,0.0004315703,0.001087501],"domain_scores_gemma":[0.9948843,0.0002764074,0.0002586897,0.00385963,0.0003049483,0.0004160993],"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.0001958108,0.002493264,0.005405143,0.0002254549,0.001300108,0.00001483301,0.001069888,0.04613055,0.08263294,0.02872667,0.2137501,0.6180552],"study_design_scores_gemma":[0.002711018,0.0001873975,0.005609337,0.0002937047,0.0001979031,0.0001260738,0.0002669074,0.465281,0.05255951,0.003033538,0.4665531,0.003180569],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4431237,0.004285732,0.3888716,0.005312764,0.001550458,0.003792588,0.001736248,0.0162687,0.1350582],"genre_scores_gemma":[0.939983,0.002437386,0.05591244,0.000139899,0.0001560758,0.0003578647,0.0002951217,0.00009940212,0.0006188605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6148746,"threshold_uncertainty_score":0.9998652,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006959275,0.0005323736,0.0005254259,0.0001937021,0.002218892,0.0004480086,0.006749192,0.0001922841,0.0002135461],"category_scores_gemma":[0.00003363235,0.0005070066,0.0001644659,0.001393096,0.0005249443,0.001502692,0.002592299,0.0007896508,0.0001996675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006851176,"about_ca_system_score_gemma":0.0005585097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001716484,"about_ca_topic_score_gemma":0.003769991,"domain_scores_codex":[0.9967418,0.0004778769,0.0006901973,0.000744175,0.0004416185,0.0009042905],"domain_scores_gemma":[0.994516,0.0001227157,0.0003691428,0.004034539,0.0005801977,0.0003773608],"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.000163443,0.002381657,0.008480408,0.00006553145,0.0004285968,0.00001036305,0.002243872,0.0009983535,0.001717114,0.2123761,0.03874395,0.7323906],"study_design_scores_gemma":[0.004640047,0.0009629587,0.05754819,0.0004426835,0.0001552658,0.0006213507,0.0002810741,0.5227,0.004713478,0.004020314,0.4004861,0.003428576],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06257071,0.0009453404,0.8147247,0.02179298,0.0004174417,0.002471595,0.0001345175,0.001982064,0.09496067],"genre_scores_gemma":[0.8271096,0.002016561,0.16916,0.0009629783,0.00007045785,0.0001961883,0.00005305873,0.00001597318,0.0004151064],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7645389,"threshold_uncertainty_score":0.9997382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912706,0.0004312706,0.0005891,0.0004131173,0.0009259888,0.000653633,0.002025323,0.0002576451,0.00005002037],"category_scores_gemma":[0.0003573883,0.0005224838,0.0002112142,0.001875154,0.0002728121,0.001793213,0.000289886,0.0004262863,0.00007514942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033734,"about_ca_system_score_gemma":0.0008483895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000681255,"about_ca_topic_score_gemma":0.001214382,"domain_scores_codex":[0.9964535,0.0003422068,0.001335179,0.0007269922,0.0004379268,0.0007042387],"domain_scores_gemma":[0.9961668,0.0006937603,0.0007829326,0.00161179,0.000560186,0.0001845631],"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.0003590166,0.003825016,0.003226424,0.0003858988,0.0004074587,0.00001334029,0.004065617,0.1075564,0.01208756,0.2090379,0.02277171,0.6362636],"study_design_scores_gemma":[0.001090459,0.0001894059,0.003647304,0.0003502098,0.00003436389,0.0000761551,0.00003850559,0.9595549,0.006355031,0.009775674,0.01824233,0.0006456688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0218766,0.0003143572,0.958881,0.003692624,0.000755207,0.001315813,0.0001561504,0.0009839134,0.01202431],"genre_scores_gemma":[0.5557098,0.00007638201,0.4435766,0.0001500498,0.0000481119,0.000281939,0.00007253728,0.00001644934,0.00006806333],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8519984,"threshold_uncertainty_score":0.9997227,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005882276,0.000530799,0.0006137231,0.0001906124,0.0006426282,0.0002544998,0.001871271,0.0003703515,0.000138584],"category_scores_gemma":[0.0001165557,0.0005920235,0.0002820625,0.0006675043,0.0002487604,0.0004843038,0.0002294505,0.0004748542,0.0001121759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000492605,"about_ca_system_score_gemma":0.0002423172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101614,"about_ca_topic_score_gemma":0.001351884,"domain_scores_codex":[0.9970313,0.0002147088,0.0009643299,0.0004673698,0.0003026292,0.00101971],"domain_scores_gemma":[0.996807,0.0002619165,0.0001718123,0.002042694,0.0003604215,0.000356109],"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.0002320609,0.00223068,0.003732337,0.0004710939,0.002891671,0.0000476701,0.001661564,0.115411,0.01952409,0.1964173,0.09502456,0.5623559],"study_design_scores_gemma":[0.001564921,0.0001039954,0.001163909,0.0002414867,0.0002240932,0.0004315224,0.0003855247,0.9073017,0.00130095,0.004829044,0.08123132,0.001221597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3782834,0.002125376,0.5911291,0.0009297763,0.001680047,0.001786438,0.001483941,0.001861024,0.02072097],"genre_scores_gemma":[0.796649,0.0002621434,0.2021141,0.0001230997,0.0002985432,0.0001883791,0.0001979299,0.0000578538,0.000108942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7918906,"threshold_uncertainty_score":0.9996531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006304327,0.0003993744,0.0005794004,0.0002000854,0.0004903586,0.0004143331,0.003479996,0.0001916781,0.00002044879],"category_scores_gemma":[0.00005830138,0.0004333309,0.0002140093,0.0010833,0.00005669251,0.0006872509,0.0004683571,0.0002032087,0.00008928975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005024316,"about_ca_system_score_gemma":0.0002884335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006278827,"about_ca_topic_score_gemma":0.001230074,"domain_scores_codex":[0.9969047,0.0003239715,0.0009826509,0.0006239706,0.0003927715,0.0007719072],"domain_scores_gemma":[0.9962718,0.0001918594,0.0005948188,0.00191845,0.0007369732,0.0002861164],"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.0003812508,0.002348217,0.00751702,0.001025423,0.001336804,0.000004873579,0.004516094,0.6580475,0.005751551,0.1319898,0.06583069,0.1212508],"study_design_scores_gemma":[0.002058405,0.0001007969,0.001910185,0.0002367078,0.0000887069,0.00002973269,0.0001584957,0.9363294,0.0003181034,0.0005733797,0.05759884,0.0005972008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05380758,0.0001171252,0.9341664,0.005658504,0.0008006501,0.001609512,0.0003637933,0.0002842969,0.0031921],"genre_scores_gemma":[0.8903282,0.00001949789,0.1081625,0.0009962366,0.000147486,0.000090798,0.0001054729,0.00001720877,0.0001326052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8365207,"threshold_uncertainty_score":0.9998118,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999604,0.0002612236,0.0002851449,0.00008030517,0.0005481265,0.0003340102,0.004977391,0.0001387945,0.00004953081],"category_scores_gemma":[0.00003283876,0.0001812664,0.0001359635,0.001586939,0.0002538401,0.0006380311,0.0004011233,0.0005240634,0.00005284754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000212645,"about_ca_system_score_gemma":0.0003644078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003018194,"about_ca_topic_score_gemma":0.002092389,"domain_scores_codex":[0.9975178,0.0004210167,0.0007027916,0.0003608054,0.0004334516,0.0005641506],"domain_scores_gemma":[0.9969271,0.0001858144,0.0004062641,0.002104322,0.0002862539,0.00009026893],"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.00004476706,0.001482097,0.007321514,0.00006154407,0.0001392023,0.000006927931,0.001174797,0.1154465,0.0002250076,0.3461084,0.04452901,0.4834602],"study_design_scores_gemma":[0.001002327,0.0001600325,0.02287454,0.0001657045,0.00003087218,0.0001323008,0.0004487238,0.9078398,0.0005717186,0.002429931,0.06379677,0.0005472467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3702238,0.001828057,0.2209562,0.0432014,0.002053855,0.004035114,0.000532357,0.0007871835,0.356382],"genre_scores_gemma":[0.9915743,0.0004363909,0.007146959,0.0004751637,0.00006372011,0.00006494166,0.00001564542,0.000006629872,0.0002161795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7923933,"threshold_uncertainty_score":0.9249314,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007114073,0.0005727723,0.0006439359,0.0005145107,0.0007267321,0.0001807325,0.005251226,0.0005356616,0.0001116467],"category_scores_gemma":[0.0001796896,0.0006940255,0.0002139191,0.001358318,0.0005105688,0.0007204691,0.000445474,0.0008808469,0.0003394033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251608,"about_ca_system_score_gemma":0.0003034016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000398883,"about_ca_topic_score_gemma":0.01671011,"domain_scores_codex":[0.9964955,0.0002758898,0.001357454,0.0004880883,0.000254222,0.001128822],"domain_scores_gemma":[0.9926305,0.0004580723,0.0002597201,0.006093317,0.0003349169,0.0002234116],"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.00004881618,0.002435318,0.002258276,0.0001541904,0.0005043883,0.000003370852,0.001647622,0.04405127,0.003564415,0.6673931,0.06368545,0.2142538],"study_design_scores_gemma":[0.003984205,0.000164568,0.004270731,0.0003529293,0.0001672827,0.0001657579,0.0009613457,0.5492945,0.001251146,0.1871919,0.2499282,0.002267567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1163238,0.0158653,0.5456467,0.0737399,0.001467069,0.007937591,0.002679644,0.007246397,0.2290936],"genre_scores_gemma":[0.7190179,0.002836901,0.2755969,0.0002693906,0.00004803192,0.001436255,0.0006435422,0.00005512206,0.00009597283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6026941,"threshold_uncertainty_score":0.9995511,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000575623,0.000378455,0.0003782625,0.0001862138,0.001608933,0.0002606012,0.003999704,0.0001554425,0.0001604015],"category_scores_gemma":[0.0000647838,0.0003823595,0.00009591244,0.001158481,0.0002412674,0.001094032,0.002887311,0.0007445025,0.0001092118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516628,"about_ca_system_score_gemma":0.0004625969,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004734203,"about_ca_topic_score_gemma":0.02170202,"domain_scores_codex":[0.9971408,0.0006847235,0.0005734551,0.0005847264,0.00033239,0.0006838645],"domain_scores_gemma":[0.9965757,0.000216517,0.0003185211,0.002271622,0.0003819687,0.000235692],"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.0001994426,0.0009152876,0.02858762,0.00001965144,0.0002690924,0.00004211486,0.007606659,0.03626769,0.0002861905,0.3226913,0.02109713,0.5820178],"study_design_scores_gemma":[0.004590198,0.0004475557,0.1437903,0.0004738821,0.00007451465,0.0001915417,0.001001486,0.7401524,0.0006221611,0.004112671,0.1023713,0.002172019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2003695,0.0007260093,0.7196562,0.0138655,0.000450404,0.000943642,0.0001023173,0.0007043134,0.06318202],"genre_scores_gemma":[0.9292666,0.00124349,0.06824581,0.0008968846,0.00007201804,0.00005729008,0.00004194596,0.00001285936,0.0001630483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7288971,"threshold_uncertainty_score":0.9998628,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001848384,0.0006701248,0.0006183827,0.0002199803,0.0008296084,0.000231035,0.001360637,0.0003666828,0.0002633747],"category_scores_gemma":[0.00002436261,0.0006896874,0.0001368433,0.0007980006,0.0002376992,0.0008355345,0.0005283909,0.0008022591,0.00008156766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008854553,"about_ca_system_score_gemma":0.00009707351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006486595,"about_ca_topic_score_gemma":0.0004077582,"domain_scores_codex":[0.9972389,0.0001400101,0.0006949416,0.0005276043,0.0004223299,0.000976228],"domain_scores_gemma":[0.9976379,0.0001162549,0.000249398,0.001388752,0.0002883471,0.0003193367],"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.00005525968,0.0002478703,0.002549863,0.00002653233,0.0002251322,0.000007104284,0.0002840291,0.9678482,0.0001436446,0.002285132,0.003834462,0.02249271],"study_design_scores_gemma":[0.001541401,0.0001484795,0.00177974,0.0003807941,0.0001490361,0.00007359081,0.0002338016,0.9813114,0.001624183,0.0003432392,0.01113452,0.001279751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4281896,0.0009475375,0.5492393,0.0007101428,0.000704201,0.001140731,0.0001892149,0.003335339,0.01554393],"genre_scores_gemma":[0.8999391,0.001709977,0.09737751,0.0001357692,0.0001484588,0.0001116723,0.00031936,0.00007421646,0.0001839771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4717495,"threshold_uncertainty_score":0.9995554,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009537711,0.0005838021,0.0005568996,0.0000840834,0.00177181,0.0009307023,0.00537575,0.000258864,0.0001929911],"category_scores_gemma":[0.00006795697,0.0004981786,0.0002709286,0.0009741611,0.0002797666,0.0006923671,0.001037037,0.0007171782,0.0005471787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000715678,"about_ca_system_score_gemma":0.0004319155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009804344,"about_ca_topic_score_gemma":0.001621709,"domain_scores_codex":[0.9958081,0.0004346922,0.0009170384,0.00097233,0.0005565851,0.001311298],"domain_scores_gemma":[0.9951551,0.0005028262,0.0004741446,0.003195113,0.0003091086,0.0003637226],"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.00005385789,0.0001927749,0.0002158431,0.000006889115,0.0001635477,0.000003109016,0.0001296805,0.6326803,0.00001848187,0.216033,0.03246374,0.1180387],"study_design_scores_gemma":[0.001736447,0.00008904908,0.0003807539,0.0001514344,0.00008525272,0.00007691602,0.00007815197,0.9364707,0.00007854719,0.009892444,0.05012857,0.0008317407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.10827,0.003689901,0.7993224,0.04835697,0.001970973,0.001937764,0.00006883754,0.001535992,0.0348472],"genre_scores_gemma":[0.864261,0.0007963073,0.1263398,0.006324568,0.0003658753,0.0003114768,0.00005796615,0.00003280337,0.001510244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.755991,"threshold_uncertainty_score":0.999747,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005869407,0.0005262227,0.0006938198,0.0002050878,0.0003358168,0.0003485889,0.003718369,0.0003326498,0.00005276586],"category_scores_gemma":[0.000016768,0.0005502377,0.0001451737,0.001916988,0.0003036461,0.0009825916,0.001141774,0.0007531129,0.00003993913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002943258,"about_ca_system_score_gemma":0.0004245983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001404811,"about_ca_topic_score_gemma":0.01079042,"domain_scores_codex":[0.9962318,0.0003462072,0.001149213,0.0008717126,0.0003914151,0.001009667],"domain_scores_gemma":[0.9952838,0.0004846923,0.0005402039,0.003081783,0.00027891,0.0003306029],"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.0000314674,0.0007841834,0.00469251,0.00004972363,0.0001012719,0.000004870711,0.0008215459,0.07580622,0.00006241765,0.008114052,0.006482967,0.9030488],"study_design_scores_gemma":[0.001503073,0.0001651891,0.007426919,0.0001853291,0.00006446778,0.0001014838,0.0002194044,0.4730457,0.00005998106,0.002898376,0.5133049,0.001025141],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03040857,0.03041502,0.9173968,0.005536628,0.0008117994,0.003943943,0.0002676822,0.0006592772,0.01056032],"genre_scores_gemma":[0.8713656,0.01220161,0.1135618,0.001206237,0.0002676198,0.0009300334,0.0002451161,0.00003580729,0.0001861925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9020236,"threshold_uncertainty_score":0.9996949,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000460948,0.0004807268,0.000918121,0.0008495097,0.0001636528,0.00008404544,0.002744258,0.000293933,0.0003430752],"category_scores_gemma":[0.0000789094,0.0005616479,0.000275538,0.003009001,0.000273739,0.000588155,0.0003494144,0.0006816072,0.00007248042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007279239,"about_ca_system_score_gemma":0.0001327953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003717204,"about_ca_topic_score_gemma":0.006951769,"domain_scores_codex":[0.9968905,0.0002515432,0.001436211,0.0004179043,0.0003141625,0.0006896306],"domain_scores_gemma":[0.9960393,0.0002909242,0.0003551659,0.002755593,0.0003711767,0.0001877965],"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.0000895928,0.001568745,0.00955385,0.0001537621,0.002564804,0.000006383174,0.002200269,0.7679817,0.01954644,0.03822821,0.01068828,0.147418],"study_design_scores_gemma":[0.001738178,0.0001293014,0.01401748,0.0005366284,0.0008726002,0.00002410474,0.001133927,0.9118972,0.03536993,0.005106411,0.0270177,0.00215654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4967344,0.005840403,0.4123751,0.002533709,0.0004521239,0.001803131,0.001107606,0.003001938,0.07615159],"genre_scores_gemma":[0.9439326,0.002981755,0.05240216,0.0001323958,0.00002647491,0.0001634458,0.0002385386,0.00003697489,0.00008567425],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4471982,"threshold_uncertainty_score":0.9996835,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004746155,0.0004565128,0.0004305971,0.0001596818,0.0007182444,0.0004878529,0.003629245,0.000200455,0.0000809927],"category_scores_gemma":[0.00002183541,0.0004748891,0.0002165999,0.0008202193,0.00008714304,0.0004125886,0.0005004274,0.0002767308,0.0004413305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004765392,"about_ca_system_score_gemma":0.0002541883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000923825,"about_ca_topic_score_gemma":0.00186728,"domain_scores_codex":[0.9968033,0.0002202213,0.0008144222,0.0007725456,0.0004708337,0.0009186658],"domain_scores_gemma":[0.9961883,0.0001871326,0.000345565,0.002363201,0.0006018859,0.0003138736],"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.00003319412,0.0006974737,0.00009720861,0.0000347216,0.000183221,0.000001940004,0.000168851,0.01960594,0.00003353809,0.3052239,0.05030944,0.6236106],"study_design_scores_gemma":[0.001950222,0.0000590244,0.002971039,0.00006274551,0.0000920313,0.00002351708,0.00005137676,0.793591,0.00004989915,0.001750326,0.1988231,0.0005756748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005754035,0.0004377677,0.9503406,0.02268731,0.000914684,0.001405672,0.0002033499,0.0006411077,0.01761545],"genre_scores_gemma":[0.8657672,0.0002702971,0.1289204,0.002486817,0.000196001,0.0005092162,0.0001598107,0.00002038614,0.001669765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8600132,"threshold_uncertainty_score":0.9997703,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009041823,0.0006428445,0.0005667619,0.0002252763,0.001072909,0.001089345,0.005465627,0.0002929608,0.0001361319],"category_scores_gemma":[0.00007216324,0.0006314573,0.0001988479,0.001262315,0.0002677475,0.004899086,0.0006034618,0.0004564224,0.0003822251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000800617,"about_ca_system_score_gemma":0.0009680327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001062191,"about_ca_topic_score_gemma":0.003214029,"domain_scores_codex":[0.995387,0.0003930113,0.001181006,0.001228787,0.0007448239,0.00106541],"domain_scores_gemma":[0.9931788,0.0002004662,0.001008276,0.00374303,0.001458681,0.0004107914],"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.000141607,0.002469747,0.001851695,0.000422133,0.0001755884,0.000002123307,0.0009784653,0.0003267512,0.0005086936,0.9376541,0.0009496653,0.05451947],"study_design_scores_gemma":[0.007018018,0.0007618084,0.01261542,0.0004076752,0.0001882288,0.0001933782,0.0002604554,0.4521261,0.003703361,0.2543319,0.265982,0.002411694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00197185,0.00002966941,0.8974597,0.003688946,0.000141718,0.09108596,0.0001426436,0.001176376,0.004303114],"genre_scores_gemma":[0.3715934,0.00002948746,0.4494542,0.0004433013,0.00009692706,0.1780817,0.00009885172,0.00002743435,0.0001747561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6833222,"threshold_uncertainty_score":0.9999476,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000543355,0.0005020528,0.0004960485,0.0001798973,0.001042963,0.0006925479,0.005718539,0.0001721471,0.0005335763],"category_scores_gemma":[0.0001537153,0.0005263648,0.0002055457,0.001259045,0.0002114295,0.0008712076,0.001286059,0.0006168733,0.002478251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006864176,"about_ca_system_score_gemma":0.000354367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003775183,"about_ca_topic_score_gemma":0.0005175264,"domain_scores_codex":[0.9966537,0.0005545281,0.000767148,0.0007003795,0.0004368823,0.0008873916],"domain_scores_gemma":[0.9940204,0.0003401991,0.0003165651,0.004494846,0.0004393476,0.0003886495],"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.00003143532,0.0009657928,0.0001625481,0.00001040657,0.0001537605,0.000007828577,0.0003202184,0.005561972,0.001327939,0.4178972,0.3137752,0.2597857],"study_design_scores_gemma":[0.001274946,0.0001753473,0.003094707,0.0001765319,0.00003105354,0.00008645906,0.00003165807,0.2928588,0.001068133,0.004250032,0.6958149,0.001137359],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02410904,0.001617483,0.6945829,0.07622015,0.001318899,0.00143155,0.0005047379,0.002533153,0.1976821],"genre_scores_gemma":[0.9340465,0.001995859,0.05969044,0.001962285,0.0001697466,0.0001231485,0.000237722,0.0000247414,0.001749526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9099375,"threshold_uncertainty_score":0.9997188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}